To simulate two pushdown stores, or one queue, on-line by a one-head tape unit requires Ω(n1.618) time. Recommended articles ...
To simulate two pushdown stores, or one queue, on-line by a one-head tape unit requires Ω(n1.618) time. Previous article in issue; Next article in issue ...
Square Time is Optimal for Simulation of One Pushdown Store or One Queue by an Oblivious One-Head Tape Unit · Tape versus Queue and Stacks: The Lower Bounds.
Sep 5, 1985 · The lower bound also holds for the simulation of two pushdown stores. Theorem 2. A one-head tape unit for simulating two pushdown stores on-line ...
Paul M. B. Vitányi: An n1.618 Lower Bound on the Time to Simulate One Queue or Two Pushdown Stores by One Tape. Inf. Process. Lett. 21(3): 147-152 (1985).
An n1.618 Lower Bound on the Time to Simulate One Queue or Two Pushdown Stores by One Tape · Computer Science, Mathematics. Information Processing Letters · 1985.
Vi2 Vitanyi, P.M.B., An Nl.618 lower bound on the time to simulate one queue or two pushdown stores by one tape, Technical Report IW 245, Mathematisch Centrum, ...
Missing: n1. | Show results with:n1.
Sci., Amsterdam, 1984. P. M. B. VITANYI,. An N**l.618 lower bound on the time to simulate one queue or two pushdown stores by one tape, Inform. Process. L&t ...
Vitanyi, P.M.B., "An N**l.618 lower bound on the time to simulate one queue or two pushdown stores by one tape," Information Processing Letters 21, pp. 147 ...
Missing: n1. | Show results with:n1.
We investigate the relative computing power of Turing machines with differences in the number of work tapes, heads pro work tape, instruction repertoire etc ...