<--- 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 | New Resource Augmentation Analysis of the Total Stretch of SRPT and SJF in Multiprocessor Scheduling Wun-Tat Chan1 Tak-Wah Lam1 Kin-Shing Liu1 Prudence W.H. Wong2 1 Department of Computer Science, University of Hong KonDocID: 1rsvR - View Document |
 | BOOKS FROM THE GET 800 COLLECTION 28 SAT Math Lessons to Improve Your Score in One Month Beginner Course Intermediate Course Advanced Course 320 SAT Math Problems Arranged by Topic and Difficulty LevelDocID: 1rkcC - View Document |
 | PDF DocumentDocID: 1rcT4 - View Document |
 | Improved Randomized On-Line Algorithms for the List Update Problem Susanne Albers Abstract The best randomizedDocID: 1r8O0 - View Document |
 | Algorithmic Number Theory MSRI Publications Volume 44, 2008 Four primality testing algorithms RENE´ SCHOOFDocID: 1qY4T - View Document |