Fast Probabilistic Algorithms for Verification of Polynomial Identities
Journal of the ACM (JACM)
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Reducibility, randomness, and intractibility (Abstract)
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
On the parallel evaluation of multivariate polynomials
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Completeness classes in algebra
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Algebraic Structures with Hard Equivalence and Minimization Problems
Journal of the ACM (JACM)
New results for random determination of equivalence of expressions
SYMSAC '86 Proceedings of the fifth ACM symposium on Symbolic and algebraic computation
A system for manipulating polynomials given by straight-line programs
SYMSAC '86 Proceedings of the fifth ACM symposium on Symbolic and algebraic computation
Feasible arithmetic computations: Valiant's hypothesis
Journal of Symbolic Computation
Greatest common divisors of polynomials given by straight-line programs
Journal of the ACM (JACM)
The complexity of equivalence for commutative rings
Journal of Symbolic Computation
Dagwood: a system for manipulating polynomials given by straight-line programs
ACM Transactions on Mathematical Software (TOMS)
On real Turing machines that toss coins
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Arithmetic Circuits and Polynomial Replacement Systems
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Algorithms on Compressed Strings and Arrays
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
Derandomizing polynomial identity tests means proving circuit lower bounds
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Determining equivalence of expressions in random polynomial time
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Derandomizing polynomial identity tests means proving circuit lower bounds
Computational Complexity
Exploiting Vanishing Polynomials for Equivalence Veri.cation of Fixed-Size Arithmetic Datapaths
ICCD '05 Proceedings of the 2005 International Conference on Computer Design
ICCAD '05 Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design
Equivalence verification of arithmetic datapaths with multiple word-length operands
Proceedings of the conference on Design, automation and test in Europe: Proceedings
The computational complexity of equivalence and isomorphism problems
The computational complexity of equivalence and isomorphism problems
Cracks in the defenses: scouting out approaches on circuit lower bounds
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Permanent does not have succinct polynomial size arithmetic circuits of constant depth
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Deterministic Polynomial Time Algorithms for Matrix Completion Problems
SIAM Journal on Computing
Marginal hitting sets imply super-polynomial lower bounds for permanent
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
On the complexity of hilbert’s 17th problem
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Hierarchical representations with signatures for large expression management
AISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Symbolic Computation
Information Processing Letters
Efficient computation in groups via compression
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
Permanent does not have succinct polynomial size arithmetic circuits of constant depth
Information and Computation
An Arithmetic Poisson Formula for the multi-variate resultant
Journal of Complexity
Probabilistic equivalence verification approach for automatic mathematical solution assessment
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
On Enumerating Monomials and Other Combinatorial Structures by Polynomial Interpolation
Theory of Computing Systems
Microprocessors & Microsystems
| Hi-index | 0.00 |