Complexity Results for Quantified Boolean Formulae Based on Complete Propositional Languages - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal on Satisfiability, Boolean Modeling and Computation Année : 2006

Complexity Results for Quantified Boolean Formulae Based on Complete Propositional Languages

Fichier non déposé

Dates et versions

hal-00109570 , version 1 (24-10-2006)

Identifiants

  • HAL Id : hal-00109570 , version 1

Citer

Sylvie Coste-Marquis, Daniel Le Berre, Florian Letombe, Pierre Marquis. Complexity Results for Quantified Boolean Formulae Based on Complete Propositional Languages. Journal on Satisfiability, Boolean Modeling and Computation, 2006, 1, pp.61-88. ⟨hal-00109570⟩

Collections

UNIV-ARTOIS CNRS
30 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More