On the complexity of computing a Gröbner basis for the radical of a zero dimensional ideal
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
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
Asymptotic acceleration of solving multivariate polynomial systems of equations
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Controlled iterative methods for solving polynomial systems
ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
On solving univariate sparse polynomials in logarithmic time
Journal of Complexity - Special issue: Foundations of computational mathematics 2002 workshops
On the complexity of real solving bivariate systems
Proceedings of the 2007 international symposium on Symbolic and algebraic computation
On the asymptotic and practical complexity of solving bivariate systems over the reals
Journal of Symbolic Computation
Solving polynomial equations in smoothed polynomial time and a near solution to smale's 17th problem
Proceedings of the forty-second ACM symposium on Theory of computing
The multivariate resultant is NP-hard in any characteristic
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
On the complexity of the multivariate resultant
Journal of Complexity
| Hi-index | 0.00 |