Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing - STOC '83 1983
DOI: 10.1145/800061.808741
|View full text |Cite
|
Sign up to set email alerts
|

Two nonlinear lower bounds

Abstract: ABS TRACT :We prove the following lower bounds for on line computation. i) Simulating two tape nondeterministic machines by one tape machines requires ~(n log log n) time.2) Simulating k tape (deterministic) machines by machines with k pushdown i/(k+ 1 ) stores requires ~(n log n) time.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

1986
1986
1993
1993

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 11 publications
references
References 9 publications
0
0
0
Order By: Relevance