An \(n^{1.618}\) lower bound on the time to simulate one queue or two pushdown stores by one tape (Q1068538): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(85)90020-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2023886101 / rank | |||
Normal rank | |||
Revision as of 03:42, 20 March 2024
scientific article
| 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 |
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
