A Product-Decomposition Bound for Bezout Numbers
From MaRDI portal
Recommendations
Cited in
(15)- Deformation techniques for sparse systems
- Toric intersection theory for affine root counting
- Mixed-volume computation by dynamic lifting applied to polynomial system solving
- HomPINNs: Homotopy physics-informed neural networks for learning multiple solutions of nonlinear elliptic differential equations
- Multiprojective witness sets and a trace test
- Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study
- Computing multihomogeneous resultants using straight-line programs
- Finding all steady state solutions of chemical kinetic models
- Regeneration homotopies for solving systems of polynomials
- Numerical algebraic geometry and algebraic kinematics
- Counting derangements and Nash equilibria
- Probabilistic saturations and Alt's problem
- Newton-Okounkov bodies of chemical reaction systems
- The algebraic synthesis of a spatial TS chain for a prescribed acceleration task
- A parametric representation of totally mixed Nash equilibria
This page was built for publication: A Product-Decomposition Bound for Bezout Numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4852618)