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
Some New Effectivity Bounds in Computational Geometry
AAECC-6 Proceedings of the 6th International Conference, on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
A new algebraic method for robot motion planning and real geometry
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Efficient techniques for multipolynomial resultant algorithms
ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
Multipolynomial resultants and linear algebra
ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
Algebraic and geometric reasoning using Dixon resultants
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
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Comparison of various multivariate resultant formulations
ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Sparsity considerations in Dixon resultants
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Robust Algorithms for Object Localization
International Journal of Computer Vision
A new algorithm for the geometric decomposition of a variety
ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
Enclosure of the Zero Set of Polynomials in Several Complex Variables
Multidimensional Systems and Signal Processing
Residual resultant over the projective plane and the implicitization problem
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
IEEE Computer Graphics and Applications
Implicitization of Parametric Curves by Matrix Annihilation
International Journal of Computer Vision - Special Issue on Computational Vision at Brown University
MR: Macaulay Resultant package for Maple
ACM SIGSAM Bulletin
MR: macaulay resultant package for maple
ACM SIGPLAN Notices - Best of PLDI 1979-1999
Improved algorithms for computing determinants and resultants
Journal of Complexity - Special issue: Foundations of computational mathematics 2002 workshops
ACM Communications in Computer Algebra
Expressing a fraction of two determinants as a determinant
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Lower bounds for zero-dimensional projections
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Computation of the solutions of nonlinear polynomial systems
Computer Aided Geometric Design
The DMM bound: multivariate (aggregate) separation bounds
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
Algebraic and numerical algorithms
Algorithms and theory of computation handbook
Proceedings of the 36th international symposium on Symbolic and algebraic computation
A perturbed differential resultant based implicitization algorithm for linear DPPEs
Journal of Symbolic Computation
Multivariate resultants in Bernstein basis
ADG'08 Proceedings of the 7th international conference on Automated deduction in geometry
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Hi-index | 0.00 |
Multipolynomial resultants provide the most efficient methods known (in terms as asymptoticcomplexity) for solving certain systems of polynomial equations or eliminating variables (Bajaj et al., 1988). The resultant of f"1, ..., f"n in K[x"1,...,x"m] will be a polynomial in m-n+1 variables which is zero when the system f"1=0 has a solution in ^m ( the algebraic closure of K). Thus the resultant defines a projection operator from ^m to ^(^m^-^n^+^1^). However, resultants are only exact conditions for homogeneous systems, and in the affine case just mentioned, the resultant may be zero even if the system has no affine solution. This is most serious when the solution set of the system of polynomials has ''excess components'' (components of dimension m-n), which may not even be affine, since these cause the resultant to vanish identically. In this paper we describe a projection operator which is not identically zero, but which is guaranteed to vanish on all the proper (dimension=m-n) components of the system f"i=0. Thus it fills the role of a general affine projection operator or variable elimination ''black box'' which can be used for arbitrary polynomial systems. The construction is based on a generalisation of the characteristic polynomial of a linear system to polynomial systems. As a corollary, we give a single-exponential time method for finding all the isolated solution points of a system of polynomials, even in the presence of infinitely many solutions, at infinity or elsewhere.