(Enter summary)
Abstract: Joris van der Hoeven's talk presents novel algorithms operating on formal power series. These new algorithms are based on fast multiplication methods (Karatsuba, Toom-Cook, FFT), and improve the best asymptotic complexities known, for example those obtained by Brent and Kung [1], while staying very efficient for the medium range (Karatsuba). (Update)
Similar documents based on text: More All
0.7: Relax, But Don't Be Too Lazy - van der Hoeven (2001)
(Correct)
0.5: Lazy Multiplication of Formal Power Series - van der Hoeven (1997)
(Correct)
0.3: Asymptotic Expansions of exp-log Functions - Richardson, Salvy, Shackell.. (1996)
(Correct)
BibTeX entry: (Update)
@misc{ hoeven-relax,
author = "Joris van der Hoeven",
title = "Relax, But Don't Be Too Lazy",
url = "citeseer.ist.psu.edu/article/vanderhoeven00relax.html" }
Citations (may not include all citations):
9
but don't be too lazy (context) - Joris - 1999
8
Practical integer division with Karatsuba complexity
- Tudor - 1997
7
Speeding up the division and square root of power series (context) - Guillaume, Michel et al. - 2000
6
Max-Planck-Institut fur Informatik (context) - Christoph, Joachim et al. - 1998
6
Lazy multiplication of formal power series
- Joris - 1997
5
Fast modular transforms via division (context) - Borodin - 1972
3
CS: a MuPAD package for counting and randomly generating com..
- Alain, Isabelle et al. - 1998
Documents on the same site (http://pauillac.inria.fr/algo/seminars/allyears.html): More
Algorithms Seminar, 1997-1998 - Salvy (1998)
(Correct)
Loop-Erased Random Walks - Richard Kenyon Universit'e
(Correct)
The Lazy Hermite Reduction - Bronstein (1998)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC