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]

Authors

Sylvie Coste-Marquis

This author has not been identified. Look up 'Sylvie Coste-Marquis' in Google

Daniel Le Berre

This author has not been identified. Look up 'Daniel Le Berre' in Google

Florian Letombe

This author has not been identified. Look up 'Florian Letombe' in Google

Pierre Marquis

This author has not been identified. Look up 'Pierre Marquis' in Google