and
Download:
pdf
by Michael S. Paterson, Michael S. Paterson, Michael J. Fischer, Michael J. Fischer, Albert R. Meyer, Albert R. Meyer
http://www.lcs.mit.edu/publications/pubs/pdf/MIT-LCS-TM-040.pdf
Add To MetaCart
Abstract:
A lower bound of cNlogN is proved for the mean time complexity of an on-line multitape Turing machine performing the multiplication of N-digit binary integers. For a more general class of machines which includes some models of random-access machines, the corresponding bound is cNlogN/loglogN. These bounds compare favorably with known upper bounds of the form cN(logN) k, and for some classes the upper and lower bounds coincide. The proofs are based on the "overlap " argument due to Cook and Aanderaa. tMuch of this work was carried out at the University of Warwick with
Citations
| 28 | On the minimum computation time of functions – Cook - 1966 |
| 13 | Real-time simulations of multihead tape units – Fischer, Meyer, et al. - 1972 |
| 8 | A One-Dimensional Real-Time Iterative Multiplier – Atrubin - 1965 |
| 3 | Fast on-line integer multiplication – Fischer, Stockmeyer - 1974 |
| 2 | Schnelle Multiplikation grosser Zahlen, Computing 7 – Schnhage, Strassen - 1971 |
| 1 | On k-tape versus (k+l)-tape real-time computation, this volume – Aanderaa - 1993 |
| 1 | Formal Laruaes and their Relation to Automata – Hopcroft, Ullman - 1969 |
