## Machine Models and Linear Time Complexity (1993)

by
Kenneth W. Regan

Venue: | SIGACT News |

Citations: | 5 - 3 self |

### BibTeX

@ARTICLE{Regan93machinemodels,

author = {Kenneth W. Regan},

title = {Machine Models and Linear Time Complexity},

journal = {SIGACT News},

year = {1993},

volume = {24},

pages = {Fall}

}

### Years of Citing Articles

### OpenURL

### Abstract

wer bounds. Machine models. Suppose that for every machine M 1 in model M 1 running in time t = t(n) there is a machine M 2 in M 2 which computes the same partial function in time g = g(t; n). If g = O(t)+O(n) we say that model M 2 simulates M 1 linearly. If g = O(t) the simulation has constant-factor overhead ; if g = O(t log t) it has a factor-of-O(log t) overhead , and so on. The simulation is on-line if each step of M 1 i