The complexity of on-line simulations between multidimensional turing machines and random access machines

Abstract

To study different implementations of arrays, we present four results on the time complexities of on-line simulations between multidimensional Turing machines and random access machines (RAMs). First, everyd-dimensional Turing machine of time complexityt can be simulated by a log-cost RAM running inO(t(logt)1−(1/d)(log logt)1/d) time. Second, everyd… (More)
DOI: 10.1007/BF01213861

Topics

1 Figure or Table

Slides referencing similar topics