On Proving Circuit Lower Bounds against the Polynomial-Time Hierarchy (Q4651502)
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: On Proving Circuit Lower Bounds against the Polynomial-Time Hierarchy |
scientific article; zbMATH DE number 2135803
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On Proving Circuit Lower Bounds against the Polynomial-Time Hierarchy |
scientific article; zbMATH DE number 2135803 |
Statements
On Proving Circuit Lower Bounds against the Polynomial-Time Hierarchy (English)
0 references
21 February 2005
0 references
stringent relativization
0 references
circuit complexity
0 references
computational complexity
0 references
Switching Lemma
0 references
Nisan-Wigderson generator
0 references
0.98267984
0 references
0.9330552
0 references
0.92440975
0 references
0.92045164
0 references
0.9173467
0 references
0.91411555
0 references
0.90934193
0 references
