An upper bound for the circuit complexity of existentially quantified Boolean formulas (Q982657)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An upper bound for the circuit complexity of existentially quantified Boolean formulas |
scientific article |
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
