Pages that link to "Item:Q2565194"
From MaRDI portal
The following pages link to On the complexity of sparse elimination (Q2565194):
Displaying 18 items.
- Implicitization of curves and (hyper)surfaces using predicted support (Q385002) (← links)
- Solving a sparse system using linear algebra (Q491257) (← links)
- Hybrid sparse resultant matrices for bivariate polynomials (Q697484) (← links)
- Using symmetries in the eigenvalue method for polynomial systems (Q731929) (← links)
- Towards toric absolute factorization (Q1030251) (← links)
- Techniques for exploiting structure in matrix formulae of the sparse resultant (Q1127958) (← links)
- How to count efficiently all affine roots of a polynomial system (Q1289017) (← links)
- Lower bounds for diophantine approximations (Q1358914) (← links)
- Symbolic and numeric methods for exploiting structure in constructing resultant matrices (Q1600039) (← links)
- Enumerating a subset of the integer points inside a Minkowski sum (Q1602946) (← links)
- Computing mixed volume and all mixed cells in quermassintegral time (Q1683740) (← links)
- Elimination theory in differential and difference algebra (Q1730314) (← links)
- Matrices in elimination theory (Q1808659) (← links)
- Sparse differential resultant for Laurent differential polynomials (Q2351806) (← links)
- Rational univariate reduction via toric resultants (Q2517810) (← links)
- Toric eigenvalue methods for solving sparse polynomial systems (Q5097381) (← links)
- Koszul-Type Determinantal Formulas for Families of Mixed Multilinear Systems (Q5157586) (← links)
- Sparse difference resultant (Q5891997) (← links)
