Uniform closure properties of P-computable functions
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
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)
Journal of Symbolic Computation - Special issue on computational algebraic complexity
Interpolating polynomials from their values
Journal of Symbolic Computation - Special issue on computational algebraic complexity
The inverse of an automorphism in polynomial time
Journal of Symbolic Computation
Dagwood: a system for manipulating polynomials given by straight-line programs
ACM Transactions on Mathematical Software (TOMS)
Checking polynomial identities over any field: towards a derandomization?
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A black box approach to the algebraic set decomposition problem
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Extended Hilbert irreducibility and its applications
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Bounds on numers of vectors of multiplicities for polynomials which are easy to compute
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
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
Chinese Remaindering for Algebraic Numbers in a Hidden Field
ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory
Factoring multivariate polynomials via partial differential equations
Mathematics of Computation
Factoring polynomials via polytopes
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Complexity issues in bivariate polynomial factorization
ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Improved dense multivariate polynomial factorization algorithms
Journal of Symbolic Computation
Factoring games to isolate strategic interactions
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Journal of Symbolic Computation
Computational complexity of sentences over fields
Information and Computation
Towards toric absolute factorization
Journal of Symbolic Computation
Hi-index | 0.00 |