Pages that link to "Item:Q5487877"
From MaRDI portal
The following pages link to A subdivision-based algorithm for the sparse resultant (Q5487877):
Displaying 33 items.
- Implicitization of curves and (hyper)surfaces using predicted support (Q385002) (← links)
- Linear sparse differential resultant formulas (Q389711) (← links)
- Solving a sparse system using linear algebra (Q491257) (← links)
- Single-lifting Macaulay-type formulae of generalized unmixed sparse resultants (Q548599) (← links)
- Hybrid sparse resultant matrices for bivariate polynomials (Q697484) (← links)
- Rational formulas for traces in zero-dimensional algebras (Q733713) (← links)
- Differential elimination by differential specialization of Sylvester style matrices (Q895967) (← links)
- Sparse resultant under vanishing coefficients (Q1408687) (← links)
- Dense resultant of composed polynomials: mixed-mixed case (Q1432880) (← links)
- Symbolic and numeric methods for exploiting structure in constructing resultant matrices (Q1600039) (← links)
- Sparse resultant of composed polynomials. II: Unmixed-mixed case. (Q1600043) (← links)
- Enumerating a subset of the integer points inside a Minkowski sum (Q1602946) (← links)
- Sparse resultants and straight-line programs (Q1690776) (← links)
- Improved algorithms for computing determinants and resultants (Q1763424) (← links)
- Exact resultants for corner-cut unmixed multivariate polynomial systems using the Dixon formulation (Q1878474) (← links)
- New bounds and an efficient algorithm for sparse difference resultants (Q2029018) (← links)
- Hyperdeterminants from the \(E_8\) discriminant (Q2062750) (← links)
- A package for computations with sparse resultants (Q2121682) (← links)
- Separation bounds for polynomial systems (Q2188979) (← links)
- Elimination for generic sparse polynomial systems (Q2249474) (← links)
- On degree bounds for the sparse Nullstellensatz (Q2312873) (← links)
- Exact computation of the topology and geometric invariants of the Voronoi diagram of spheres in 3D (Q2434569) (← links)
- Resultants of partially composed polynomials (Q2457350) (← links)
- Computing multihomogeneous resultants using straight-line programs (Q2457419) (← links)
- Rational univariate reduction via toric resultants (Q2517810) (← links)
- Constructing Sylvester-type resultant matrices using the Dixon formulation (Q2643539) (← links)
- Resultants for unmixed bivariate polynomial systems produced using the Dixon formulation (Q2643546) (← links)
- Matrix Formulae of Differential Resultant for First Order Generic Ordinary Differential Polynomials (Q2799577) (← links)
- A Poisson formula for the sparse resultant (Q5248613) (← links)
- A polyhedral homotopy algorithm for real zeros (Q6047530) (← links)
- The Canny-Emiris conjecture for the sparse resultant (Q6101263) (← links)
- On the complexity of Chow and Hurwitz forms (Q6536635) (← links)
- Sparse resultant-based minimal solvers in computer vision and their connection with the action matrix (Q6596057) (← links)
