How to count efficiently all affine roots of a polynomial system
From MaRDI portal
Publication:1289017
DOI10.1016/S0166-218X(99)00003-7zbMATH Open1034.68715OpenAlexW1987964348MaRDI QIDQ1289017FDOQ1289017
Authors: Ioannis Z. Emiris, J. Verschelde 
Publication date: 1999
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00003-7
Cites Work
- Title not available (Why is that?)
- On the Newton polytope of the resultant
- Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
- On The Complexity of Computing Mixed Volumes
- A Polyhedral Method for Solving Sparse Polynomial Systems
- Fiber polytopes
- Mixed volumes of polytopes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the complexity of sparse elimination
- A convex geometric approach to counting the roots of a polynomial system
- Efficient incremental algorithms for the sparse resultant and the mixed volume
- Mixed-volume computation by dynamic lifting applied to polynomial system solving
- Counting affine roots of polynomial systems via pointed Newton polytopes
- The BKK root count in $\mathbf {C}^n$
- Bernstein's theorem in affine space
- Toric intersection theory for affine root counting
Cited In (8)
- Matrices in elimination theory
- Numerical homotopies to compute generic points on positive dimensional algebraic sets
- Computing isolated roots of sparse polynomial systems in affine space
- Mixed volume techniques for embeddings of Laman graphs
- On the multiplicity of isolated roots of sparse polynomial systems
- Singular bifurcations in higher index differential-algebraic equations
- Elimination for generic sparse polynomial systems
- Global optimality conditions and optimization methods for polynomial programming problems
This page was built for publication: How to count efficiently all affine roots of a polynomial system
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1289017)
