Pages that link to "Item:Q2457419"
From MaRDI portal
The following pages link to Computing multihomogeneous resultants using straight-line programs (Q2457419):
Displaying 9 items.
- Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree \((1,1)\): algorithms and complexity (Q629349) (← links)
- Rational formulas for traces in zero-dimensional algebras (Q733713) (← links)
- A parametric representation of totally mixed Nash equilibria (Q979929) (← links)
- Sparse resultants and straight-line programs (Q1690776) (← links)
- Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization (Q1690788) (← links)
- Multilinear polynomial systems: root isolation and bit complexity (Q1994888) (← links)
- Elimination for generic sparse polynomial systems (Q2249474) (← links)
- Computations of multi-resultant with mechanization (Q2572016) (← links)
- Multihomogeneous resultant formulae for systems with scaled support (Q5891547) (← links)