Linear Time and Memory-Efficient Computation

DOI10.1137/S0097539793251888zbMath0841.68041OpenAlexW1999665052MaRDI QIDQ4875449

Kenneth W. Regan

Publication date: 2 July 1996

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539793251888

zbMATH Keywords

Turing machinesfinite automatoncomplexity classesrandom-access machines

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

This page was built for publication: Linear Time and Memory-Efficient Computation