The following pages link to (Q4110543):
Displaying 20 items.
- Homotopy techniques for multiplication modulo triangular sets (Q651881) (← links)
- On the complexities of multipoint evaluation and interpolation (Q706626) (← links)
- A simple and fast algorithm for computing exponentials of power series (Q989478) (← links)
- Is \(\pi\) normal ? (Q1058539) (← links)
- On square roots and their representations (Q1080408) (← links)
- Optimal solution of nonlinear equations (Q1086985) (← links)
- Bibliography on the evaluation of numerical software (Q1254823) (← links)
- Why does information-based complexity use the real number model? (Q1292417) (← links)
- Use of algebraically independent numbers for zero recognition of polynomial terms. (Q1426048) (← links)
- Computing Chebyshev knot diagrams (Q1680160) (← links)
- On solving univariate sparse polynomials in logarithmic time (Q1763426) (← links)
- Unrestricted algorithms for reciprocals and square roots (Q1819533) (← links)
- New techniques for the computation of linear recurrence coefficients (Q1971066) (← links)
- Quantum random access stored-program machines (Q2084736) (← links)
- Learning Poisson binomial distributions (Q2345953) (← links)
- Sieve algorithms for perfect power testing (Q2366224) (← links)
- Fast computation of special resultants (Q2457312) (← links)
- The Borwein Brothers, Pi and the AGM (Q3298036) (← links)
- Une méthodologie du calcul hardware des fonctions élémentaires (Q3750023) (← links)
- Fast evaluation and root finding for polynomials with floating-point coefficients (Q6615413) (← links)
