Towards a tight hardness-randomness connection between permanent and arithmetic circuit identity testing (Q1941704)
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: Towards a tight hardness-randomness connection between permanent and arithmetic circuit identity testing |
scientific article; zbMATH DE number 6147771
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Towards a tight hardness-randomness connection between permanent and arithmetic circuit identity testing |
scientific article; zbMATH DE number 6147771 |
Statements
Towards a tight hardness-randomness connection between permanent and arithmetic circuit identity testing (English)
0 references
21 March 2013
0 references
computational complexity
0 references
lower bounds
0 references
permanent
0 references
arithmetic circuits
0 references
polynomial identity testing
0 references
derandomization
0 references
0.8170551657676697
0 references
0.802969217300415
0 references
0.7968891263008118
0 references
