A subdivision-based algorithm for the sparse resultant
From MaRDI portal
(Redirected from Publication:5487877)
Recommendations
Cited in
(44)- Techniques for exploiting structure in matrix formulae of the sparse resultant
- Sparse resultant under vanishing coefficients
- Dense resultant of composed polynomials: mixed-mixed case
- Symbolic and numeric methods for exploiting structure in constructing resultant matrices
- Sparse resultant of composed polynomials. II: Unmixed-mixed case.
- Enumerating a subset of the integer points inside a Minkowski sum
- Sparse resultants and straight-line programs
- Improved algorithms for computing determinants and resultants
- Exact resultants for corner-cut unmixed multivariate polynomial systems using the Dixon formulation
- Efficient incremental algorithms for the sparse resultant and the mixed volume
- On the complexity of the multivariate resultant
- New bounds and an efficient algorithm for sparse difference resultants
- Hyperdeterminants from the E₈ discriminant
- A package for computations with sparse resultants
- Separation bounds for polynomial systems
- Elimination for generic sparse polynomial systems
- On degree bounds for the sparse Nullstellensatz
- Exact computation of the topology and geometric invariants of the Voronoi diagram of spheres in 3D
- Computing tropical resultants
- Resultants of partially composed polynomials
- Computing multihomogeneous resultants using straight-line programs
- Rational univariate reduction via toric resultants
- Constructing Sylvester-type resultant matrices using the Dixon formulation
- Resultants for unmixed bivariate polynomial systems produced using the Dixon formulation
- Matrix formulae of differential resultant for first order generic ordinary differential polynomials
- Conditions for determinantal formula for resultant of a polynomial system
- Implicitization of curves and (hyper)surfaces using predicted support
- Linear sparse differential resultant formulas
- scientific article; zbMATH DE number 1253983 (Why is no real title available?)
- scientific article; zbMATH DE number 1263319 (Why is no real title available?)
- scientific article; zbMATH DE number 503188 (Why is no real title available?)
- scientific article; zbMATH DE number 1961538 (Why is no real title available?)
- scientific article; zbMATH DE number 806917 (Why is no real title available?)
- Solving a sparse system using linear algebra
- A Poisson formula for the sparse resultant
- Single-lifting Macaulay-type formulae of generalized unmixed sparse resultants
- A polyhedral homotopy algorithm for real zeros
- The Canny-Emiris conjecture for the sparse resultant
- On the complexity of Chow and Hurwitz forms
- Sparse resultant-based minimal solvers in computer vision and their connection with the action matrix
- Mixed subdivisions suitable for the greedy Canny-Emiris formula
- Hybrid sparse resultant matrices for bivariate polynomials
- Rational formulas for traces in zero-dimensional algebras
- Differential elimination by differential specialization of Sylvester style matrices
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)
