An upper bound for the circuit complexity of existentially quantified Boolean formulas (Q982657)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5731733
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An upper bound for the circuit complexity of existentially quantified Boolean formulas |
scientific article; zbMATH DE number 5731733 |
Statements
An upper bound for the circuit complexity of existentially quantified Boolean formulas (English)
0 references
7 July 2010
0 references
quantified Boolean formulas
0 references
circuits
0 references
complexity
0 references
0 references
0.9123168
0 references
0.9076207
0 references
0.90234256
0 references
0.90163475
0 references
0.9015457
0 references
0.8924122
0 references
0.8901407
0 references
0.88986135
0 references
