Derandomizing Arthur-Merlin games and approximate counting implies exponential-size lower bounds (Q645124)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Derandomizing Arthur-Merlin games and approximate counting implies exponential-size lower bounds |
scientific article |
Statements
Derandomizing Arthur-Merlin games and approximate counting implies exponential-size lower bounds (English)
0 references
8 November 2011
0 references
approximate counting
0 references
Arthur-Merlin protocols
0 references
circuit complexity
0 references
derandomization
0 references
0 references
0 references
