The following pages link to (Q4766043):
Displayed 11 items.
- Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation (Q540327) (← links)
- Computational schemes for subresultant chains (Q831961) (← links)
- Regularity of the Euclid algorithm; application to the analysis of fast GCD algorithms (Q1025385) (← links)
- On the complexity of the Lickteig-Roy subresultant algorithm (Q1757020) (← links)
- A fast version of the Schur-Cohn algorithm. (Q1977142) (← links)
- Fast computation of approximant bases in canonical form (Q2284957) (← links)
- Parallelization of triangular decompositions: techniques and implementation (Q2674015) (← links)
- Perturbation Analysis of the QR factor R in the context of LLL lattice basis reduction (Q2894516) (← links)
- Computing the torsion points of a variety defined by lacunary polynomials (Q2894522) (← links)
- Two efficient algorithms for the computation of ideal sums in quadratic orders (Q3377005) (← links)
- On Schönhage's algorithm and subquadratic integer gcd computation (Q5429518) (← links)