On time versus space. II
From MaRDI portal
Publication:1152954
DOI10.1016/0022-0000(81)90035-0zbMath0462.68029OpenAlexW1989122074MaRDI QIDQ1152954
Wolfgang J. Paul, K. Ruediger Reischuk
Publication date: 1981
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(81)90035-0
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (7)
On time versus space III ⋮ On the complexity of intersecting finite state automata and \(\mathcal{NL}\) versus \(\mathcal{NP}\) ⋮ Parallelizing time with polynomial circuits ⋮ An information-theoretic approach to time bounds for on-line computation ⋮ Linear speed-up does not hold on Turing machines with tree storages ⋮ Improved simulation of nondeterministic Turing machines ⋮ Minimizing access pointers into trees and arrays
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two fast simulations which imply some fast string matching and palindrome-recognition algorithms
- Tape bounds for time-bounded Turing machines
- On Time Versus Space
- Relations Among Complexity Measures
- On the Computational Complexity of Algorithms
- Boolean Memories
- Relations Between Time and Tape Complexities
This page was built for publication: On time versus space. II
