Towards a tight hardness-randomness connection between permanent and arithmetic circuit identity testing (Q1941704)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Towards a tight hardness-randomness connection between permanent and arithmetic circuit identity testing |
scientific article |
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
