Complexity Results for Quantified Boolean Formulae Based on Complete Propositional Languages

Sylvie Coste-Marquis, Daniel Le Berre, Florian Letombe, Pierre Marquis. Complexity Results for Quantified Boolean Formulae Based on Complete Propositional Languages. JSAT, 1(1):61-88, 2006. [doi]

Possibly Related Publications

The following publications are possibly variants of this publication: