How to count efficiently all affine roots of a polynomial system
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 50337 (Why is no real title available?)
- scientific article; zbMATH DE number 3601710 (Why is no real title available?)
- scientific article; zbMATH DE number 503188 (Why is no real title available?)
- scientific article; zbMATH DE number 1069614 (Why is no real title available?)
- scientific article; zbMATH DE number 236540 (Why is no real title available?)
- A Polyhedral Method for Solving Sparse Polynomial Systems
- A convex geometric approach to counting the roots of a polynomial system
- Bernstein's theorem in affine space
- Counting affine roots of polynomial systems via pointed Newton polytopes
- Efficient incremental algorithms for the sparse resultant and the mixed volume
- Fiber polytopes
- Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
- Mixed volumes of polytopes
- Mixed-volume computation by dynamic lifting applied to polynomial system solving
- On The Complexity of Computing Mixed Volumes
- On the Newton polytope of the resultant
- On the complexity of sparse elimination
- The BKK root count in $\mathbf {C}^n$
- 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)
