Search
Now showing items 1-2 of 2
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 ...
String-matching and Other Products
(1974-01)
The string-matching problem considered here is to find all occurrences of a given pattern as a substring of another longer string. When the pattern is simply a given string of symbols, there is an algorithm due to Morris, ...