An $nsp {1.618}$ lower bound on the time to simulate one queue or two pushdown stores by one tape.

Additional Metadata
MSC	Models of computation (Turing machines, etc.) (msc 68Q05), Turing machines and related notions (msc 03D10), Complexity of computation (including implicit computational complexity) (msc 03D15), Complexity classes (hierarchies, relations among complexity classes, etc.) (msc 68Q15)
Publisher	north-holland
Journal	Information Processing Letters
Organisation	Quantum Computing and Advanced System Research
Citation APA Style AAA Style APA Style Cell Style Chicago Style Harvard Style IEEE Style MLA Style Nature Style Vancouver Style American-Institute-of-Physics Style Council-of-Science-Editors Style BibTex Format Endnote Format RIS Format CSL Format DOIs only Format	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.

Additional Files
Publisher Version
2499D.pdf Final Version , 1mb

Publication