On the worst-case arithmetic complexity of approximating zeros of polynomials
Journal of Complexity
Applied & computational complex analysis: power series integration conformal mapping location of zero
On the worst-case arithmetic complexity of approximating zeros of systems of polynomials
SIAM Journal on Computing
Polynomial and matrix computations (vol. 1): fundamental algorithms
Polynomial and matrix computations (vol. 1): fundamental algorithms
Monomial bases and polynomial system solving (extended abstract)
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
The structure of sparse resultant matrices
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Solving special polynomial systems by using structured matrices and algebraic residues
FoCM '97 Selected papers of a conference on Foundations of computational mathematics
Multivariate polynomials, duality, and structured matrices
Journal of Complexity
An Efficient Algorithm for the Sparse Mixed Resultant
AAECC-10 Proceedings of the 10th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Controlled iterative methods for solving polynomial systems
ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
The complexity of the matrix eigenproblem
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Univariate polynomials: nearly optimal algorithms for factorization and rootfinding
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Symbolic and numeric methods for exploiting structure in constructing resultant matrices
Journal of Symbolic Computation
Univariate polynomials: nearly optimal algorithms for numerical factorization and root-finding
Journal of Symbolic Computation - Computer algebra: Selected papers from ISSAC 2001
A New Criterion for Normal Form Algorithms
AAECC-13 Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Intrinsic Near Quadratic Complexity Bounds for Real Multivariate Root Counting
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Computer algebra handbook
On solving univariate sparse polynomials in logarithmic time
Journal of Complexity - Special issue: Foundations of computational mathematics 2002 workshops
Optimization and NP_R-completeness of certain fewnomials
Proceedings of the 2009 conference on Symbolic numeric computation
Irreducible decomposition of polynomial ideals
Journal of Symbolic Computation
Algebraic and numerical algorithms
Algorithms and theory of computation handbook
Optimizing n-variate (n+k)-nomials for small k
Theoretical Computer Science
| Hi-index | 0.00 |