A subdivision-based algorithm for the sparse resultant
From MaRDI portal
Publication:5487877
Recommendations
Cited in
(38)- Separation bounds for polynomial systems
- 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
- Implicitization of curves and (hyper)surfaces using predicted support
- scientific article; zbMATH DE number 1961538 (Why is no real title available?)
- Resultants for unmixed bivariate polynomial systems produced using the Dixon formulation
- Sparse resultant under vanishing coefficients
- Sparse resultant-based minimal solvers in computer vision and their connection with the action matrix
- Enumerating a subset of the integer points inside a Minkowski sum
- Sparse resultant of composed polynomials. II: Unmixed-mixed case.
- On the complexity of the multivariate resultant
- Constructing Sylvester-type resultant matrices using the Dixon formulation
- A Poisson formula for the sparse resultant
- Rational univariate reduction via toric resultants
- Mixed subdivisions suitable for the greedy Canny-Emiris formula
- 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
- Solving a sparse system using linear algebra
- Sparse resultants and straight-line programs
- The Canny-Emiris conjecture for the sparse resultant
- 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
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)
