Derandomizing polynomial identity tests means proving circuit lower bounds
From Thermodynamics of Computation
- reference groups
- Computer Science Theory
- author-supplied keywords
- Circuit lower bounds
- Derandomization
- Hardness-randomness tradeoffs
- Polynomial identity testing
- keywords
- authors
- Valentine Kabanets
- Russell Impagliazzo
- title
- Derandomizing polynomial identity tests means proving circuit lower bounds
- type
- generic
- year
- 2004
- source
- Computational Complexity
- pages
- 1-46
- volume
- 13
- issue
- 1-2
- publisher
- Birkhauser Verlag Basel
- link
- https://www.mendeley.com/catalogue/aef0d8d9-37bd-3378-a593-99766cb4a350/(Error!"Error!" is not a number.)
Counts
- Citation count
- 317
- Page views
- 0
Identifiers
- doi: 10.1007/s00037-004-0182-6 (Google search)
- issn: 14208954
- sgr: 15244352005
- scopus: 2-s2.0-15244352005
- pui: 41217703
