<--- Back to Details
First PageDocument Content
Multiplication / Mathematics / Karatsuba algorithm / Fast Fourier transform / Multiplication algorithm
Date: 2009-07-31 09:25:52
Multiplication
Mathematics
Karatsuba algorithm
Fast Fourier transform
Multiplication algorithm

Space- and Time-Efficient Polynomial Multiplication

Add to Reading List

Source URL: issac2009.kias.re.kr

Download Document from Source Website

File Size: 122,01 KB

Share Document on Facebook

Similar Documents

An Asynchronous, Iterative Implementation of the Original Booth Multiplication Algorithm A. Efthymiou W. Suntiamorntut

DocID: 1u1aw - View Document

Fast Integer Multiplication with ¨ Schonhage-Strassen’s Algorithm Alexander Kruppa CACAO team at LORIA, Nancy

DocID: 1sjaC - View Document

Algebra / Computing / Mathematics / Software optimization / Parallel computing / Roofline model / Software testing / Matrix multiplication / NC / Matrix / Lookup table / Matrix multiplication algorithm

Design of Parallel and High Performance Computing HS 2013 Markus P¨ uschel, Torsten Hoefler Department of Computer Science ETH Zurich

DocID: 1rlc8 - View Document

Mathematics / Algebra / Computational complexity theory / Analysis of algorithms / Multiplication / Numerical linear algebra / Matrix multiplication algorithm / Matrix multiplication / Strassen algorithm / Fast Fourier transform / Multiplication algorithm / Algorithm

A Graph Expansion and Communication Costs of Fast Matrix Multiplication Grey Ballard, University of California at Berkeley James Demmel, University of California at Berkeley ¨ Berlin

DocID: 1rgSV - View Document

Graph theory / Mathematics / Combinatorial optimization / Edsger W. Dijkstra / Matrix multiplication algorithm / NP-complete problems / Matching / Routing algorithms / Computational complexity theory / Connected component / Dynamic programming / Graph coloring

Graph Expansion and Communication Costs of Fast Matrix Multiplication Grey Ballard ∗ James Demmel †

DocID: 1rcVB - View Document