An \(n^{1.618}\) lower bound on the time to simulate one queue or two pushdown stores by one tape (Q1068538)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An \(n^{1.618}\) lower bound on the time to simulate one queue or two pushdown stores by one tape |
scientific article; zbMATH DE number 3932389
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An \(n^{1.618}\) lower bound on the time to simulate one queue or two pushdown stores by one tape |
scientific article; zbMATH DE number 3932389 |
Statements
An \(n^{1.618}\) lower bound on the time to simulate one queue or two pushdown stores by one tape (English)
0 references
1985
0 references
multitape Turing machines
0 references
time complexity
0 references
on-line simulation by single- head tape units
0 references
Kolmogorov complexity
0 references
0 references
