<--- 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 | EFFICIENT DEALIASED CONVOLUTIONS WITHOUT PADDING∗ JOHN C. BOWMAN† AND MALCOLM ROBERTS† SIAM J. Sci. Comput., 33:1, Abstract. Algorithms are developed for calculating dealiased linear convolution sumsDocID: 1pIUd - View Document |
| Implementation of the DKSS Algorithm for Multiplication of Large Numbers Christoph Lüders Universität Bonn The International Symposium on Symbolic and Algebraic Computation,DocID: 1pdWN - View Document |
| Volume 10 NumberNucleic Acids Research An efficient method for matching nucleic acid sequencesDocID: 1oqSQ - View Document |
| RelaxMiddle-JSCStyle-sent.pdfDocID: 1oo1n - View Document |