New Algorithms for Relaxed Multiplication (2003)
by
Joris Van Der Hoeven
,
Let C F
BibTeX
@MISC{Hoeven03newalgorithms,
author = {Joris Van Der Hoeven and Let C F},
title = {New Algorithms for Relaxed Multiplication},
year = {2003}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
this paper, we will show how to reduce this logarithmic factor in the case when the constant ring has suOEciently many 2 -th roots of unity
Citations
| 592 | The Art of Computer Programming, Volume 2: Seminumerical Algorithms (3rd Edition - Knuth - 1997 |
| 445 | An algorithm for the machine calculation of complex fourier series - Cooley, Tukey - 1965 |
| 127 | On fast multiplication of polynomials over arbitrary algebras - Cantor, Kaltofen - 1991 |
| 124 | Multiplication of multidigit numbers on automata - Karatsuba - 1963 |
| 89 | Fast algorithms for manipulating formal power series - Brent, Kung - 1978 |
| 76 | Schnelle Multiplikation grosser Zahlen - Schonhage, Strassen - 1971 |
| 14 | but don’t be too lazy - Relax |
| 5 | der Hoeven. Lazy multiplication of formal power series - van - 1997 |
