LCS Technical Memos (1974 - 2003): Recent submissions
Now showing items 349-351 of 486
-
Ten Thousand and One Logics of Programming
(1980-02) -
An Efficient Algorithm for Determine the Length of the Longest Dead Path in an "LIFO" Branch-and-bound Exploration Schema
(1980-01)The length of the longest dead path (LLDP) is a widely used parameter in estimating the efficiency of branch-and-bound optimization algorithms that employ the LIFO exploration schema. Thanks to two original theorems, we ... -
Space-Bounded Simulation of Multitape Turing Machines
(1980-01)A new proof of a theorem of Hopcroft, Paul, and Valiant is presented: every deterministic multitape Turing machine of time complexity T(n) can be simulated by a deterministic Turing machine of space complexity T(n)/log ...
