Pages that link to "Item:Q2265255"
From MaRDI portal
The following pages link to On computing reciprocals of power series (Q2265255):
Displaying 17 items.
- Wiener-Hopf and spectral factorization of real polynomials by Newton's method (Q393389) (← links)
- Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation (Q540327) (← links)
- Fast arithmetic for triangular sets: from theory to practice (Q1025397) (← links)
- Cauchy index computation (Q1127957) (← links)
- A method for calculating the reciprocal coefficients of function matrices (Q1224410) (← links)
- A survey of techniques in applied computational complexity (Q1224857) (← links)
- The complexity of bivariate power series arithmetic. (Q1401232) (← links)
- Variations on computing reciprocals of power series (Q1607045) (← links)
- A fast algorithm for computing the number of magic series (Q2155555) (← links)
- On the number of multiplications needed to invert a monic power series over fields of characteristic two (Q2387412) (← links)
- Fast computation of special resultants (Q2457312) (← links)
- Chebyshev series expansion of inverse polynomials (Q2503031) (← links)
- Fast algorithms for computing isogenies between elliptic curves (Q3577024) (← links)
- On the Periods of Generalized Fibonacci Recurrences (Q4305958) (← links)
- Irregular primes to two billion (Q5270847) (← links)
- Fast convolutions meet Montgomery (Q5444325) (← links)
- Sylvester-Habicht sequences and fast Cauchy index computation (Q5929709) (← links)
