Stop the war!
Остановите войну!
for scientists:
default search action
"Complexity Results for Quantified Boolean Formulae Based on Complete ..."
Sylvie Coste-Marquis et al. (2006)
- Sylvie Coste-Marquis, Daniel Le Berre, Florian Letombe, Pierre Marquis:
Complexity Results for Quantified Boolean Formulae Based on Complete Propositional Languages. J. Satisf. Boolean Model. Comput. 1(1): 61-88 (2006)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.