Pages that link to "Item:Q5120221"
From MaRDI portal
The following pages link to On Computing the Resultant of Generic Bivariate Polynomials (Q5120221):
Displaying 17 items.
- Multipolynomial resultant algorithms (Q1260754) (← links)
- Linear recurring sequences for computing the resultant of multivariate polynomials (Q1318402) (← links)
- Generalized resultants over unirational algebraic varieties (Q1569828) (← links)
- Fast computation of the Bézout and Dixon resultant matrices (Q1599530) (← links)
- Improved algorithms for computing determinants and resultants (Q1763424) (← links)
- Fast computation of generic bivariate resultants (Q1996880) (← links)
- Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one (Q2066949) (← links)
- Subalgebras in \(K[x]\) of small codimension (Q2100114) (← links)
- Subresultant chains using Bézout matrices (Q2109975) (← links)
- Fast computation of special resultants (Q2457312) (← links)
- Efficient Algorithms for MultiPolynomial Resultant (Q3140559) (← links)
- An algorithmic approach to Chevalley’s Theorem on images of rational morphisms between affine varieties (Q5018379) (← links)
- A fast randomized geometric algorithm for computing Riemann-Roch spaces (Q5113675) (← links)
- Implementations of Efficient Univariate Polynomial Matrix Algorithms and Application to Bivariate Resultants (Q5121112) (← links)
- High-order lifting for polynomial Sylvester matrices (Q6149161) (← links)
- Bivariate polynomial reduction and elimination ideal over finite fields (Q6615408) (← links)
- Computing the characteristic polynomial of generic Toeplitz-like and Hankel-like matrices (Q6666544) (← links)
