The BKK root count in \mathbf {C}^n
From MaRDI portal
Publication:4718399
Recommendations
Cites work
- scientific article; zbMATH DE number 4022030 (Why is no real title available?)
- scientific article; zbMATH DE number 3572315 (Why is no real title available?)
- scientific article; zbMATH DE number 3445379 (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
- Counting affine roots of polynomial systems via pointed Newton polytopes
- Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
- Nonlinear mappings of analytic type in Banach spaces
- Symbolic homotopy construction
- The random product homotopy and deficient polynomial systems
Cited in
(25)- 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
- Computing tensor eigenvalues via homotopy methods
- MULTIPLICITY AND ŁOJASIEWICZ EXPONENT OF GENERIC LINEAR SECTIONS OF MONOMIAL IDEALS
- Deformation techniques for sparse systems
- Zero-Hopf bifurcation of limit cycles in certain differential systems
- How to count efficiently all affine roots of a polynomial system
- The special closure of polynomial maps and global non-degeneracy
- Unmixing the mixed volume computation
- Toric intersection theory for affine root counting
- Finding all isolated zeros of polynomial systems in \(\mathbb{C}^n\) via stable mixed volumes
- Rational univariate reduction via toric resultants
- Numerical algebraic geometry: a new perspective on gauge and string theories
- Proper reparametrization for inherently improper unirational varieties
- Khovanskii bases for semimixed systems of polynomial equations -- approximating stationary nonlinear Newtonian dynamics
- 3D genome reconstruction from partially phased Hi-C data
- On the polyhedral homotopy method for solving generalized Nash equilibrium problems of polynomials
- Mixed cell computation in HOM4ps
- Well-posedness in unconstrained polynomial optimization problems
- Solving polynomial systems by polyhedral homotopies
- Elimination for generic sparse polynomial systems
- Efficiently counting affine roots of mixed trigonometric polynomial systems
- Polynomial maps with maximal multiplicity and the special closure
This page was built for publication: The BKK root count in $\mathbf {C}^n$
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4718399)
