On the exact complexity of evaluating quantified \(k\)-\textsc{cnf} (Q1949746)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the exact complexity of evaluating quantified \(k\)-\textsc{cnf} |
scientific article |
Statements
On the exact complexity of evaluating quantified \(k\)-\textsc{cnf} (English)
0 references
16 May 2013
0 references
quantified Boolean formulas
0 references
satisfiability
0 references