Randomness efficient identity testing of multivariate polynomials
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
On the Computational Hardness of Testing Square-Freeness of Sparse Polynomials
AAECC-13 Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
The Hidden Number Problem in Extension Fields and Its Applications
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
On reducing a system of equations to a single equation
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Interpolation of depth-3 arithmetic circuits with two multiplication gates
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Deterministically testing sparse polynomial identities of unbounded degree
Information Processing Letters
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
| Hi-index | 0.00 |