Single-lifting Macaulay-type formulae of generalized unmixed sparse resultants
From MaRDI portal
Publication:548599
DOI10.1016/j.jsc.2011.02.002zbMath1217.65091WikidataQ57908714 ScholiaQ57908714MaRDI QIDQ548599
Christos Konaxis, Ioannis Z. Emiris
Publication date: 29 June 2011
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2011.02.002
65H10: Numerical computation of solutions to systems of equations
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Single-lifting Macaulay-type formulae of generalized unmixed sparse resultants
- A new polynomial-time algorithm for linear programming
- The number of roots of a system of equations
- Multigraded resultants of Sylvester type
- On the Newton polytope of the resultant
- Sparse resultant under vanishing coefficients
- Enumerating a subset of the integer points inside a Minkowski sum
- Solving polynomial equations. Foundations, algorithms, and applications
- Finding all isolated zeros of polynomial systems in \(\mathbb{C}^n\) via stable mixed volumes
- Multihomogeneous resultant formulae by means of complexes
- The resultant of an unmixed bivariate system
- Macaulay style formulas for sparse resultants
- Calculs de résidus toriques
- Sylvester-resultants for bivariate polynomials with planar newton polygons
- Using Algebraic Geometry
- A Polyhedral Method for Solving Sparse Polynomial Systems
- Expressing a fraction of two determinants as a determinant
- A subdivision-based algorithm for the sparse resultant
- Multihomogeneous resultant formulae for systems with scaled support
- Explicit formulas for the multivariate resultant.
