Sparse resultants and straight-line programs
From MaRDI portal
Publication:1690776
DOI10.1016/j.jsc.2017.05.005zbMath1409.13050OpenAlexW2617389625MaRDI QIDQ1690776
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
Symbolic computation and algebraic computation (68W30) Solving polynomial systems; resultants (13P15)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Newton polyhedra of discriminants of projections
- Deformation techniques for sparse systems
- The number of roots of a system of equations
- On the Newton polytope of the resultant
- Product formulas for resultants and Chow forms
- Lower bounds for diophantine approximations
- Straight-line programs in geometric elimination theory
- Sparse resultant under vanishing coefficients
- Computing parametric geometric resolutions
- On the complexity of computing determinants
- Matrices in elimination theory
- The computational complexity of the Chow form
- On the complexity of the multivariate resultant
- Deformation techniques for efficient polynomial equation solving.
- Computing multihomogeneous resultants using straight-line programs
- Macaulay style formulas for sparse resultants
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- On The Complexity of Computing Mixed Volumes
- Using Algebraic Geometry
- A Poisson formula for the sparse resultant
- Expressing a fraction of two determinants as a determinant
- A subdivision-based algorithm for the sparse resultant
- A Gröbner free alternative for polynomial system solving
- Explicit formulas for the multivariate resultant.
