Search
Now showing items 1-1 of 1
An Improved Overlap Argument for On-line Multiplication
(1974-01)
A lower bound of cN1ogN 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 the corresponding bound ...