Sparse resultants and straight-line programs

DOI10.1016/J.JSC.2017.05.005MaRDI QIDQ1690776zbMATH OpenOpenAlexFDO

Authors Gabriela Jeronimo, Juan Sabia

Publication date 12 January 2018

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/11336/89011

zbMATH Keywords

algorithmsstraight-line programssparse resultants

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Solving polynomial systems; resultants (13P15)

Recommendations

• A subdivision-based algorithm for the sparse resultant
• Single-lifting Macaulay-type formulae of generalized unmixed sparse resultants
• scientific article; zbMATH DE number 503188
• scientific article; zbMATH DE number 1736029
• Techniques for exploiting structure in matrix formulae of the sparse resultant
• Sparse resultant of composed polynomials. I: Mixed-unmixed case.
• Subdivisions for macaulay formulas of sparse systems
• scientific article; zbMATH DE number 1253983
• Global residues for sparse polynomial systems
• scientific article; zbMATH DE number 1263319

Cites work

• scientific article; zbMATH DE number 3759547 (Why is no real title available?)
• scientific article; zbMATH DE number 3461412 (Why is no real title available?)
• scientific article; zbMATH DE number 1273538 (Why is no real title available?)
• scientific article; zbMATH DE number 481965 (Why is no real title available?)
• scientific article; zbMATH DE number 503188 (Why is no real title available?)
• scientific article; zbMATH DE number 575960 (Why is no real title available?)
• scientific article; zbMATH DE number 976329 (Why is no real title available?)
• scientific article; zbMATH DE number 806915 (Why is no real title available?)
• scientific article; zbMATH DE number 806917 (Why is no real title available?)
• scientific article; zbMATH DE number 960150 (Why is no real title available?)
• A Gröbner free alternative for polynomial system solving
• A Poisson formula for the sparse resultant
• A subdivision-based algorithm for the sparse resultant
• Computing multihomogeneous resultants using straight-line programs
• Computing parametric geometric resolutions
• Deformation techniques for efficient polynomial equation solving.
• Deformation techniques for sparse systems
• Explicit formulas for the multivariate resultant.
• Expressing a fraction of two determinants as a determinant
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Lower bounds for diophantine approximations
• Macaulay style formulas for sparse resultants
• Matrices in elimination theory
• Modern computer algebra
• Newton polyhedra of discriminants of projections
• On The Complexity of Computing Mixed Volumes
• On the Newton polytope of the resultant
• On the complexity of computing determinants
• On the complexity of the multivariate resultant
• Product formulas for resultants and Chow forms
• Sparse resultant under vanishing coefficients
• Straight-line programs in geometric elimination theory
• The computational complexity of the Chow form
• The number of roots of a system of equations
• Using Algebraic Geometry

Cited in

(4)

• A package for computations with sparse resultants
• Computing multihomogeneous resultants using straight-line programs
• The Canny-Emiris conjecture for the sparse resultant
• New bounds and an efficient algorithm for sparse difference resultants

Describes a project that uses

Uses Software

• Geomsolvex
• Mathemagix
• Kronecker

This page was built for publication: Sparse resultants and straight-line programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1690776)