1985
An $nsp {1.618}$ lower bound on the time to simulate one queue or two pushdown stores by one tape.
Publication
Publication
Information Processing Letters Issue 3 p. 147- 152
Additional Metadata | |
---|---|
, , , | |
north-holland | |
Information Processing Letters | |
Organisation | Quantum Computing and Advanced System Research |
Vitányi, P. (1985). An $nsp {1.618}$ lower bound on the time to simulate one queue or two pushdown stores by one tape. Information Processing Letters, (3), 147–152. |