Sparse resultants and straight-line programs

DOI10.1016/J.JSC.2017.05.005zbMATH Open1409.13050OpenAlexW2617389625MaRDI QIDQ1690776FDOQ1690776

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

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

zbMATH Keywords

algorithmsstraight-line programssparse resultants

Mathematics Subject Classification ID

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

Cites Work

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

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

Uses Software

• Kronecker
• Mathemagix
• Geomsolvex

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)