Computational complexity of quantified Boolean formulas with fixed maximal deficiency (Q955019)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computational complexity of quantified Boolean formulas with fixed maximal deficiency |
scientific article; zbMATH DE number 5368348
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational complexity of quantified Boolean formulas with fixed maximal deficiency |
scientific article; zbMATH DE number 5368348 |
Statements
Computational complexity of quantified Boolean formulas with fixed maximal deficiency (English)
0 references
18 November 2008
0 references
quantified Boolean formula
0 references
deficiency
0 references
model
0 references
minimal false formula
0 references
complexity
0 references
0 references
0.90949595
0 references
0.90949595
0 references
0.90234256
0 references
0.90040565
0 references
0.8973336
0 references
