Two nonlinear lower bounds for on-line computations

DOI10.1016/S0019-9958(84)80019-4zbMath0589.68039MaRDI QIDQ3718158

Wolfgang J. Paul, Pavol Ďuriš, Zvi Galil, K. Ruediger Reischuk

Publication date: 1984

Published in: Information and Control (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (4)

On the structure of one-tape nondeterministic Turing machine time hierarchy ⋮ Tape versus queue and stacks: The lower bounds ⋮ Milking the Aanderaa argument ⋮ On the power of several queues

This page was built for publication: Two nonlinear lower bounds for on-line computations