SIGN IN
SIGN UP
Faster integer multiplication
Full Text:
Pdf
Buy this Article
Author:
Martin Fürer
Pennsylvania State University, University Park, PA
Published in:
· Proceeding
STOC '07
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Pages 57 - 66
ACM
New York, NY
, USA
©2007
table of contents
ISBN: 978-1-59593-631-8
doi>
10.1145/1250790.1250800
2007 Article
Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 48
· Downloads (cumulative): 1,289
· Citation Count: 33
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
STOC'13
Share:
|
Tags:
algebraic algorithms
algorithms
analysis of algorithms
complexity
computation of transforms
computations on polynomials
computer arithmetic
discrete fourier transform
fft
integer multiplication
theory
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder