The BKK root count in $\mathbf {C}^n$
From MaRDI portal
Publication:4718399
DOI10.1090/S0025-5718-96-00778-8zbMath0855.65053MaRDI QIDQ4718399
Publication date: 3 December 1996
Published in: Mathematics of Computation (Search for Journal in Brave)
Symbolic computation and algebraic computation (68W30) Numerical computation of solutions to systems of equations (65H10)
Related Items
The special closure of polynomial maps and global non-degeneracy, Unmixing the mixed volume computation, Computing isolated roots of sparse polynomial systems in affine space, On the polyhedral homotopy method for solving generalized Nash equilibrium problems of polynomials, Efficiently counting affine roots of mixed trigonometric polynomial systems, 3D genome reconstruction from partially phased Hi-C data, Proper reparametrization for inherently improper unirational varieties, Polynomial maps with maximal multiplicity and the special closure, Mixed cell computation in HOM4ps, Elimination for generic sparse polynomial systems, Well-Posedness in Unconstrained Polynomial Optimization Problems, Computing Tensor Eigenvalues via Homotopy Methods, Numerical algebraic geometry: a new perspective on gauge and string theories, Rational univariate reduction via toric resultants, Finding all isolated zeros of polynomial systems in \(\mathbb{C}^n\) via stable mixed volumes, Deformation techniques for sparse systems, Mixed volume techniques for embeddings of Laman graphs, How to count efficiently all affine roots of a polynomial system, MULTIPLICITY AND ŁOJASIEWICZ EXPONENT OF GENERIC LINEAR SECTIONS OF MONOMIAL IDEALS, Toric intersection theory for affine root counting, On the multiplicity of isolated roots of sparse polynomial systems, Numerical homotopies to compute generic points on positive dimensional algebraic sets
Cites Work
- The random product homotopy and deficient polynomial systems
- Symbolic homotopy construction
- A convex geometric approach to counting the roots of a polynomial system
- Nonlinear mappings of analytic type in Banach spaces
- Counting affine roots of polynomial systems via pointed Newton polytopes
- Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
- A Polyhedral Method for Solving Sparse Polynomial Systems
- Unnamed Item
- Unnamed Item
- Unnamed Item