Fast On-Line Integer Multiplication (1974)

Cached

Download Links

by Michael J. Fischer , Larry J. Stockmeyer
Venue:PROC. 5TH ACM SYMPOSIUM ON THEORY OF COMPUTING
Citations:5 - 1 self

Active Bibliography

17 An overview of computational complexity – Stephen A. Cook - 1983
41 Faster Integer Multiplication – Martin Fürer - 2007
6 On Kolmogorov machines and related issues – Yuri Gurevich - 1988
Licensed under a Creative Commons Attribution License – Amir M. Ben-amram, Niels H. Christensen, Jakob, Grue Simonsen
7 FFT-based dense polynomial arithmetic on multi-cores – Marc Moreno Maza, Yuzhen Xie - 2009
Space- and Time-Efficient Polynomial Multiplication – Daniel S. Roche - 2009
3 Relax But Don't Be Too Lazy – Joris van der Hoeven - 2002
1 Newton’s method and FFT trading – Joris Van Der Hoeven - 2006
Newton’s method and FFT trading ∗ Joris van der Hoeven – unknown authors - 2008
Newton’s method and FFT trading ∗ Joris van der Hoeven – unknown authors - 2009
1 Master’s Examination Committee: – F. H. Abdulrahman, Dr. Rongxing Li, Dr. Toni Schenk
DOI: 10.1109/TC.2011.110 On Polynomial Multiplication in Chebyshev Basis – Pascal Giorgi - 2013
Graph-Theoretic Arguments . . . – Leslie G. Valiant - 2008
2 Multi-Head Finite Automata: Characterizations, Concepts and Open Problems – Markus Holzer, Martin Kutrib, Andreas Malcher - 2009
On Boyer-Moore Preprocessing – Heikki Hyyrö - 2004
String Matching using Inverted Lists – Chouvalit Khancome, Veera Boonjing - 2007
Borders and Finite Automata – Martin Simunek, et al. - 2006
1 The conjugacy problem in right-angled Artin groups and – John Crisp, Eddy Godelle, Bert Wiest - 802
Submitted exclusively to the London Mathematical Society doi:10.1112/0000/000000 The – John Crisp, Eddy Godelle, Bert Wiest