On the worst-case arithmetic complexity of approximating zeros of systems of polynomials
SIAM Journal on Computing
Solving systems of nonlinear polynomial equations faster
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
Multipolynomial resultant algorithms
Journal of Symbolic Computation
Three-dimensional computer vision: a geometric viewpoint
Three-dimensional computer vision: a geometric viewpoint
Polynomial and matrix computations (vol. 1): fundamental algorithms
Polynomial and matrix computations (vol. 1): fundamental algorithms
Computing selected solutions of polynomial equations
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
Monomial bases and polynomial system solving (extended abstract)
ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
Gröbner duality and multiplicities in polynomial system solving
ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Matrix eigenproblems are at the heart of polynomial system solving
ACM SIGSAM Bulletin
A reordered Schur factorization method for zero-dimensional polynomial systems with multiple roots
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
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
Asymptotic acceleration of solving multivariate polynomial systems of equations
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
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
Iterative Methods for Sparse Linear Systems
Iterative Methods for Sparse Linear Systems
The complexity of the matrix eigenproblem
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Solving some overdetermined polynomial systems
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
Solving projective complete intersection faster
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
A New Criterion for Normal Form Algorithms
AAECC-13 Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Projective Reconstruction from N Views Having One View in Common
ICCV '99 Proceedings of the International Workshop on Vision Algorithms: Theory and Practice
Computing minimum distance between two implicit algebraic surfaces
Computer-Aided Design
| Hi-index | 0.00 |