The following pages link to (Q4306894):
Displaying 23 items.
- Even faster integer multiplication (Q306687) (← links)
- A note on the paper ``Multiplication of polynomials modulo \(x^n\)'' by Murat Cenk and Ferruh Özbudak (Q418751) (← links)
- Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\) (Q1273735) (← links)
- Why does information-based complexity use the real number model? (Q1292417) (← links)
- Variations on computing reciprocals of power series (Q1607045) (← links)
- Fast computation of the biquadratic residue symbol. (Q1864853) (← links)
- Number theory -- probabilistic, heuristic, and computational approaches (Q1876476) (← links)
- How can a complex square root be computed in an optimal way? (Q1918948) (← links)
- Deformation techniques for efficient polynomial equation solving. (Q1977143) (← links)
- Fast multivariate multi-point evaluation revisited (Q2283121) (← links)
- Generalized polar varieties: geometry and algorithms (Q2387411) (← links)
- On the complexity exponent of polynomial system solving (Q2658549) (← links)
- A search for Wilson primes (Q3189466) (← links)
- Two efficient algorithms for the computation of ideal sums in quadratic orders (Q3377005) (← links)
- Relative class number of imaginary Abelian fields of prime conductor below 10000 (Q4257701) (← links)
- An O(M(n) logn) Algorithm for the Jacobi Symbol (Q4931642) (← links)
- Вычисление гипергеометрических рядов с квазилинейной временной и линейной eмкостной сложностью (Q4960011) (← links)
- On computation of the Bessel function by summing up the series (Q5043040) (← links)
- (Q5150372) (← links)
- (Q5150581) (← links)
- ON THE COMPLEXITY OF COMPUTING PRIME TABLES ON THE TURING MACHINE (Q5150729) (← links)
- \((1+i)\)-ary GCD computation in \(\mathbb Z[i]\) as an analogue to the binary GCD algorithm. (Q5926303) (← links)
- Irregular primes and cyclotomic invariants to 12 million (Q5928882) (← links)
