A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Space bounded computations: review and new separation results
1991
Theoretical Computer Science
Ranjan, D., R. Chang and J. Hartmanis, Space bounded computations: review and new separation results, Theoretical Computer Science 80 (1991) 289-302. In this paper we review the key results about space bounded complexity classes, discuss the central open problems and outline the prominent proof techniques. We show that, for a slightly modified Turing machine model, low level deterministic and nondeterministic space bounded complexity classes are different. Furthermore, for this computation
doi:10.1016/0304-3975(91)90391-e
fatcat:xxm3hj5hwncsre7kavd4wbptbq