The following pages link to Bernstein's theorem in affine space (Q677017):
Displaying 21 items.
- Computing isolated roots of sparse polynomial systems in affine space (Q410703) (← links)
- Foreword. What is numerical algebraic geometry? (Q507158) (← links)
- Deformation techniques for sparse systems (Q1029552) (← links)
- Mixed volume techniques for embeddings of Laman graphs (Q1037775) (← links)
- How to count efficiently all affine roots of a polynomial system (Q1289017) (← links)
- Toric intersection theory for affine root counting (Q1295703) (← links)
- Heuristic methods for computing the minimal multi-homogeneous Bézout number. (Q1412521) (← links)
- Numerical homotopies to compute generic points on positive dimensional algebraic sets (Q1594830) (← links)
- Enumerating a subset of the integer points inside a Minkowski sum (Q1602946) (← links)
- Efficiently counting affine roots of mixed trigonometric polynomial systems (Q1697755) (← links)
- Matrices in elimination theory (Q1808659) (← links)
- Solving degenerate sparse polynomial systems faster (Q1808666) (← links)
- Finding all isolated zeros of polynomial systems in \(\mathbb{C}^n\) via stable mixed volumes (Q1808667) (← links)
- Elimination for generic sparse polynomial systems (Q2249474) (← links)
- On the multiplicity of isolated roots of sparse polynomial systems (Q2334502) (← links)
- Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study (Q2387419) (← links)
- Unmixing the mixed volume computation (Q2421592) (← links)
- Rational univariate reduction via toric resultants (Q2517810) (← links)
- Minimizing multi-homogeneous Bézout numbers by a local search method (Q2701563) (← links)
- Mixed multiplicities of ideals versus mixed volumes of polytopes (Q5297029) (← links)
- A systematic framework for solving geometric constraints analytically (Q5926297) (← links)
