On time versus space II

Authors:
W. J. Paul;R. Reischuk
Affiliations:
-;-
Venue:
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
Year:
1979

Citing 0
Cited 1

Fast reductions from RAMs to delegatable succinct constraint satisfaction problems: extended abstract

Proceedings of the 4th conference on Innovations in Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Logarithmically t(n)-time bounded RAMs can be simulated by t(n)/log t(n)-tape bounded Turing machines, t(n)-time bounded multidimensional multitape Turing machines can be simulated by t(n) loglog t(n)/log t(n)-tape bounded Turing machines.