17 search results - page 4 / 4 » Derandomizing polynomial identity tests means proving circui... |
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We present several new examples of speed-ups obtainable by quantum algorithms in the context of property testing. First, motivated by sampling algorithms, we consider probability d...
STACS
2010
Springer
14 years 14 hour ago
2010
Springer
Kabanets and Impagliazzo [KI04] show how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit ...