Reducing randomness via irrational numbers

Checking polynomial identities over any field: towards a derandomization?

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing

Randomness efficient identity testing of multivariate polynomials

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing

Deterministic identity testing for multivariate polynomials

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms

On Testing for Zero Polynomials by a Set of Points with Bounded Precision

COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics

A Probabilistic Zero-Test for Expressions Involving Root of Rational Numbers

ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms

On testing for zero polynomials by a set of points with bounded precision

Theoretical Computer Science - Computing and combinatorics

Derandomizing polynomial identity tests means proving circuit lower bounds

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing

Primality and identity testing via Chinese remaindering

Journal of the ACM (JACM)

Primality and Identity Testing via Chinese Remaindering

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science

Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing

Randomised algorithms for isomorphisms of simple types

Mathematical Structures in Computer Science

Deterministically testing sparse polynomial identities of unbounded degree

Information Processing Letters

Improved Polynomial Identity Testing for Read-Once Formulas

APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

Complexity Lower Bounds using Linear Algebra

Foundations and Trends® in Theoretical Computer Science

The computational complexity of equivalence and isomorphism problems

The computational complexity of equivalence and isomorphism problems

Blackbox identity testing for bounded top fanin depth-3 circuits: the field doesn't matter

Proceedings of the forty-third annual ACM symposium on Theory of computing

Quadratic lower bounds on matrix rigidity

TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation