A subdivision-based algorithm for the sparse resultant
DOI10.1145/337244.337247zbMATH Open1094.65508OpenAlexW2043606168MaRDI QIDQ5487877FDOQ5487877
Authors: Ioannis Z. Emiris, John Canny 
Publication date: 12 September 2006
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/337244.337247
Recommendations
determinantal formula for sparse resultantmixed polyhedral subdivision of Minkowski sum of Newton polytopes
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Numerical computation of solutions to systems of equations (65H10)
Cited In (38)
- A package for computations with sparse resultants
- Exact computation of the topology and geometric invariants of the Voronoi diagram of spheres in 3D
- Computing multihomogeneous resultants using straight-line programs
- On degree bounds for the sparse Nullstellensatz
- Hybrid sparse resultant matrices for bivariate polynomials
- Single-lifting Macaulay-type formulae of generalized unmixed sparse resultants
- Symbolic and numeric methods for exploiting structure in constructing resultant matrices
- Title not available (Why is that?)
- Implicitization of curves and (hyper)surfaces using predicted support
- Resultants for unmixed bivariate polynomial systems produced using the Dixon formulation
- Sparse resultant-based minimal solvers in computer vision and their connection with the action matrix
- Sparse resultant under vanishing coefficients
- Enumerating a subset of the integer points inside a Minkowski sum
- Sparse resultant of composed polynomials. II: Unmixed-mixed case.
- A Poisson formula for the sparse resultant
- On the complexity of the multivariate resultant
- Constructing Sylvester-type resultant matrices using the Dixon formulation
- Mixed subdivisions suitable for the greedy Canny-Emiris formula
- Rational univariate reduction via toric resultants
- Conditions for determinantal formula for resultant of a polynomial system
- Differential elimination by differential specialization of Sylvester style matrices
- Resultants of partially composed polynomials
- Dense resultant of composed polynomials: mixed-mixed case
- Improved algorithms for computing determinants and resultants
- Exact resultants for corner-cut unmixed multivariate polynomial systems using the Dixon formulation
- Elimination for generic sparse polynomial systems
- A polyhedral homotopy algorithm for real zeros
- The Canny-Emiris conjecture for the sparse resultant
- Solving a sparse system using linear algebra
- Sparse resultants and straight-line programs
- Computing tropical resultants
- Matrix formulae of differential resultant for first order generic ordinary differential polynomials
- New bounds and an efficient algorithm for sparse difference resultants
- Rational formulas for traces in zero-dimensional algebras
- Hyperdeterminants from the \(E_8\) discriminant
- On the complexity of Chow and Hurwitz forms
- Linear sparse differential resultant formulas
- Separation bounds for polynomial systems
This page was built for publication: A subdivision-based algorithm for the sparse resultant
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5487877)
