On Proving Circuit Lower Bounds against the Polynomial-Time Hierarchy (Q4651502)
From MaRDI portal
scientific article; zbMATH DE number 2135803
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
