Pages that link to "Item:Q4878511"
From MaRDI portal
The following pages link to A Polyhedral Method for Solving Sparse Polynomial Systems (Q4878511):
Displaying 50 items.
- Mixed-volume computation by dynamic lifting applied to polynomial system solving (Q1921341) (← links)
- Affine solution sets of sparse polynomial systems (Q1940920) (← links)
- Homotopy techniques for solving sparse column support determinantal polynomial systems (Q1979422) (← links)
- Beyond polyhedral homotopies (Q1994128) (← links)
- Clustering complex zeros of triangular systems of polynomials (Q2035625) (← links)
- Solving decomposable sparse systems (Q2048838) (← links)
- State polytopes related to two classes of combinatorial neural codes (Q2081911) (← links)
- Euclidean distance degree and mixed volume (Q2098233) (← links)
- Numerical root finding via Cox rings (Q2173863) (← links)
- Tropical combinatorial Nullstellensatz and sparse polynomials (Q2194772) (← links)
- Elimination for generic sparse polynomial systems (Q2249474) (← links)
- Seven mutually touching infinite cylinders (Q2261578) (← links)
- Criteria for strict monotonicity of the mixed volume of convex polytopes (Q2334550) (← links)
- Overdetermined systems of sparse polynomial equations (Q2340503) (← links)
- Finding sparse solutions of systems of polynomial equations via group-sparsity optimization (Q2349523) (← links)
- Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study (Q2387419) (← links)
- Cell decomposition of almost smooth real algebraic surfaces (Q2391817) (← links)
- Unmixing the mixed volume computation (Q2421592) (← links)
- Counting and locating the solutions of polynomial systems of maximum likelihood equations. I. (Q2457330) (← links)
- On the frontiers of polynomial computations in tropical geometry (Q2457404) (← links)
- Lattice polytopes cut out by root systems and the Koszul property (Q2519769) (← links)
- Nine equilibrium points of four point charges on the plane (Q2673752) (← links)
- Facets and facet subgraphs of symmetric edge polytopes (Q2685702) (← links)
- Minimizing multi-homogeneous Bézout numbers by a local search method (Q2701563) (← links)
- Macaulay style formulas for sparse resultants (Q2782655) (← links)
- Polynomial homotopy method for the sparse interpolation problem. I: Equally spaced sampling (Q2788631) (← links)
- Computing tensor eigenvalues via homotopy methods (Q2797103) (← links)
- Exploiting chordal structure in polynomial ideals: a Gröbner bases approach (Q2818203) (← links)
- Computing All Space Curve Solutions of Polynomial Systems by Polyhedral Methods (Q2829992) (← links)
- Computational approach to compact Riemann surfaces (Q2958636) (← links)
- Regeneration homotopies for solving systems of polynomials (Q3081287) (← links)
- Valuations and Tensor Weights on Polytopes (Q3433991) (← links)
- Estimating the Attraction Domain for the Boost Inverter (Q3454371) (← links)
- Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems (Q4305440) (← links)
- Random polynomials with prescribed Newton polytope (Q4441811) (← links)
- Counting Equilibria of the Kuramoto Model Using Birationally Invariant Intersection Index (Q4561326) (← links)
- A Polyhedral Method for Sparse Systems with Many Positive Solutions (Q4624926) (← links)
- Fibre tilings (Q4676330) (← links)
- Solving Polynomial Systems via Truncated Normal Forms (Q4689237) (← links)
- The BKK root count in $\mathbf {C}^n$ (Q4718399) (← links)
- Epsilon local rigidity and numerical algebraic geometry (Q5030251) (← links)
- Polymake.jl: A New Interface to polymake (Q5041077) (← links)
- Toric eigenvalue methods for solving sparse polynomial systems (Q5097381) (← links)
- Positive solutions of sparse polynomial systems (Q5145945) (← links)
- A Robust Numerical Path Tracking Algorithm for Polynomial Homotopy Continuation (Q5146689) (← links)
- Directed acyclic decomposition of Kuramoto equations (Q5242040) (← links)
- Mixed multiplicities of ideals versus mixed volumes of polytopes (Q5297029) (← links)
- A symmetric homotopy and hybrid polynomial system solving method for mixed trigonometric polynomial systems (Q5418491) (← links)
- Well-Posedness in Unconstrained Polynomial Optimization Problems (Q5741069) (← links)
- A systematic framework for solving geometric constraints analytically (Q5926297) (← links)
