Pages that link to "Item:Q1763424"
From MaRDI portal
The following pages link to Improved algorithms for computing determinants and resultants (Q1763424):
Displaying 21 items.
- Rational formulas for traces in zero-dimensional algebras (Q733713) (← links)
- Bezout matrices, subresultant polynomials and parameters (Q833155) (← links)
- Bernstein-Bezoutian matrices and curve implicitization (Q884463) (← links)
- Elimination theory in differential and difference algebra (Q1730314) (← links)
- Improved algorithms for computing determinants and resultants (Q1763424) (← links)
- Randomized preprocessing versus pivoting (Q1940337) (← links)
- Multilinear polynomial systems: root isolation and bit complexity (Q1994888) (← links)
- Fast computation of generic bivariate resultants (Q1996880) (← links)
- Arithmetically improved algorithmic performance (Q2266560) (← links)
- Matrix formulæ for resultants and discriminants of bivariate tensor-product polynomials (Q2284950) (← links)
- Sparse differential resultant for Laurent differential polynomials (Q2351806) (← links)
- Schur aggregation for linear systems and determinants (Q2378504) (← links)
- The shifted number system for fast linear algebra on integer matrices (Q2387425) (← links)
- Computing polynomial univariate representations of zero-dimensional ideals by Gröbner basis (Q2392952) (← links)
- Additive preconditioning and aggregation in matrix computations (Q2425466) (← links)
- Fast computation of special resultants (Q2457312) (← links)
- Sublinear root detection and new hardness results for sparse polynomials over finite fields (Q2816831) (← links)
- Implementations of Efficient Univariate Polynomial Matrix Algorithms and Application to Bivariate Resultants (Q5121112) (← links)
- Sparse difference resultant (Q5891997) (← links)
- Computational Science and Its Applications – ICCSA 2004 (Q5901306) (← links)
- Counting solutions of a polynomial system locally and exactly (Q6170809) (← links)
