<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2014-04-26 00:17:51Multiplication Computational complexity theory Finite fields Multiplication algorithm Fast Fourier transform Factorial Time complexity XTR SchnhageStrassen algorithm Karatsuba algorithm |
Add to Reading List |
RelaxMiddle-JSCStyle-sent.pdf | An Asynchronous, Iterative Implementation of the Original Booth Multiplication Algorithm A. Efthymiou W. SuntiamorntutDocID: 1u1aw - View Document |
| Fast Integer Multiplication with ¨ Schonhage-Strassen’s Algorithm Alexander Kruppa CACAO team at LORIA, NancyDocID: 1sjaC - View Document |
| Design of Parallel and High Performance Computing HS 2013 Markus P¨ uschel, Torsten Hoefler Department of Computer Science ETH ZurichDocID: 1rlc8 - View Document |
| A Graph Expansion and Communication Costs of Fast Matrix Multiplication Grey Ballard, University of California at Berkeley James Demmel, University of California at Berkeley ¨ BerlinDocID: 1rgSV - View Document |
| Graph Expansion and Communication Costs of Fast Matrix Multiplication Grey Ballard ∗ James Demmel †DocID: 1rcVB - View Document |