Derandomizing Arthur-Merlin games and approximate counting implies exponential-size lower bounds (Q645124)
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: Derandomizing Arthur-Merlin games and approximate counting implies exponential-size lower bounds |
scientific article; zbMATH DE number 5969192
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Derandomizing Arthur-Merlin games and approximate counting implies exponential-size lower bounds |
scientific article; zbMATH DE number 5969192 |
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
0.8584891557693481
0 references
0.8398193717002869
0 references
0.8320106267929077
0 references
0.8213497400283813
0 references
0.8181644678115845
0 references
