Matching is as easy as matrix inversion
Combinatorica
SIAM Journal on Computing
Checking polynomial identities over any field: towards a derandomization?
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Journal of the ACM (JACM)
Reducing Randomness via Irrational Numbers
SIAM Journal on Computing
Probabilistic algorithms for sparse polynomials
EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation
Primality and identity testing via Chinese remaindering
Journal of the ACM (JACM)
Testing polynomials which are easy to compute (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Deterministic polynomial identity testing in non-commutative models
Computational Complexity
Derandomizing polynomial identity tests means proving circuit lower bounds
Computational Complexity
Polynomial Identity Testing for Depth 3 Circuits
Computational Complexity
Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits
SIAM Journal on Computing
CCC '08 Proceedings of the 2008 IEEE 23rd Annual Conference on Computational Complexity
Diagonal Circuit Identity Testing and Lower Bounds
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Arithmetic Circuits: A Chasm at Depth Four
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
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
A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits
SIAM Journal on Computing
The monomial ideal membership problem and polynomial identity testing
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits
SIAM Journal on Computing
Black-box identity testing of depth-4 multilinear circuits
Proceedings of the forty-third annual ACM symposium on Theory of computing
Proving lower bounds via pseudo-random generators
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
| Hi-index | 0.00 |