Two nonlinear lower bounds

Authors:
Pavol Dûriš;Wolfgang Paul;Zvi Galil;Ruediger Reischuk
Affiliations:
Slovak Academy of Science;IBM, San Jose;Columbia University and Tel-Aviv University;University of the Saarlandes
Venue:
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Year:
1983

Citing 5
Cited 2

Two-Tape Simulation of Multitape Turing Machines

Journal of the ACM (JACM)
New Real-Time Simulations of Multihead Tape Units

Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
A "Fast Implementation" of a Multidimensional Storage into a Tree Storage

Proceedings of the 7th Colloquium on Automata, Languages and Programming
Two tapes are better than one for nondeterministic machines

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing

Two tapes are better than one for off-line Turing machines

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Quadratic lower bounds for deterministic and nondeterministic one-tape turing machines

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove the following lower bounds for on line computation. 1) Simulating two tape nondeterministic machines by one tape machines requires &Ohgr;(n log log n) time. 2) Simulating k tape (deterministic) machines by machines with k pushdown stores requires &Ohgr;(n log1/(k+1)n) time.