Pages that link to "Item:Q1289017"
From MaRDI portal
The following pages link to How to count efficiently all affine roots of a polynomial system (Q1289017):
Displaying 8 items.
- Computing isolated roots of sparse polynomial systems in affine space (Q410703) (← links)
- Global optimality conditions and optimization methods for polynomial programming problems (Q496629) (← links)
- Mixed volume techniques for embeddings of Laman graphs (Q1037775) (← links)
- Numerical homotopies to compute generic points on positive dimensional algebraic sets (Q1594830) (← links)
- Matrices in elimination theory (Q1808659) (← links)
- Elimination for generic sparse polynomial systems (Q2249474) (← links)
- On the multiplicity of isolated roots of sparse polynomial systems (Q2334502) (← links)
- Singular bifurcations in higher index differential-algebraic equations (Q4806513) (← links)