Derandomizing polynomial identity tests means proving circuit lower bounds
Computational Complexity
Polynomial Identity Testing for Depth 3 Circuits
Computational Complexity
Arithmetic Circuits: A survey of recent results and open questions
Foundations and Trends® in Theoretical Computer Science
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
Recent results on polynomial identity testing
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Algebraic independence and blackbox identity testing
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
An Almost Optimal Rank Bound for Depth-3 Identities
SIAM Journal on Computing
On comparing sums of square roots of small integers
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Algebraic independence and blackbox identity testing
Information and Computation
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
We propose a general methodology for testing whether a given polynomial with integer coefficients is identically zero. The methodology evaluates the polynomial at efficiently computable approximations of suitable irrational points. In contrast to the classical technique of DeMillo, Lipton, Schwartz, and Zippel, this methodology can decrease the error probability by increasing the precision of the approximations instead of using more random bits. Consequently, randomized algorithms that use the classical technique can generally be improved using the new methodology. To demonstrate the methodology, we discuss two nontrivial applications. The first is to decide whether a graph has a perfect matching in parallel. Our new NC algorithm uses fewer random bits while doing less work than the previously best NC algorithm by Chari, Rohatgi, and Srinivasan. The second application is to test the equality of two multisets of integers. Our new algorithm improves upon the previously best algorithms by Blum and Kannan and can speed up their checking algorithm for sorting programs on a large range of inputs.