Probabilistic quantifiers, adversaries, and complexity classes: an overview
Proc. of the conference on Structure in complexity theory
Computational complexities of diophantine equations with parameters
Journal of Algorithms
Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity class
Journal of Computer and System Sciences - 17th Annual ACM Symposium in the Theory of Computing, May 6-8, 1985
Some algebraic and geometric computations in PSPACE
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Quantifier elimination in the theory of an algebraically-closed field
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Solving systems of nonlinear polynomial equations faster
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
A random polynomial-time algorithm for approximating the volume of convex bodies
Journal of the ACM (JACM)
Mathematics for computer algebra
Mathematics for computer algebra
An introduction to parallel algorithms
An introduction to parallel algorithms
Hilbert's tenth problem
Specified precision polynomial root isolation is in NC
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
Polynomial and matrix computations (vol. 1): fundamental algorithms
Polynomial and matrix computations (vol. 1): fundamental algorithms
A course in computational algebraic number theory
A course in computational algebraic number theory
Efficient incremental algorithms for the sparse resultant and the mixed volume
Journal of Symbolic Computation
An efficient algorithm for the complex roots problem
Journal of Complexity
On the combinatorial and algebraic complexity of quantifier elimination
Journal of the ACM (JACM)
Hilbert's Nullstellensatz is in the polynomial hierarchy
Journal of Complexity - Special issue for the Foundations of Computational Mathematics conference, Rio de Janeiro, Brazil, Jan. 1997
Complexity and real computation
Complexity and real computation
On The Complexity of Computing Mixed Volumes
SIAM Journal on Computing
Rational parametrization of surfaces
Journal of Symbolic Computation
Solving degenerate sparse polynomial systems faster
Journal of Symbolic Computation - Special issue on polynomial elimination—algorithms and applications
Fast Multiple-Precision Evaluation of Elementary Functions
Journal of the ACM (JACM)
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Journal of the ACM (JACM)
Cook's versus Valiant's hypothesis
Theoretical Computer Science - Selected papers in honor of Manuel Blum
Uncomputably large integral points on algebraic plane curves?
Theoretical Computer Science - Selected papers in honor of Manuel Blum
On the distribution of integer points on curves of genus zero
Theoretical Computer Science - Selected papers in honor of Manuel Blum
Randomized and deterministic algorithms for the dimension of algebraic varieties
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
On the complexity of path-following newton algorithms for solving systems of polynomial equations with integer coefficients
| Hi-index | 0.00 |