Space bounded computations : Review and new separation results [chapter]

J. Hartmanis, Desh Ranjan
1989 Lecture Notes in Computer Science  
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 model, we show that Savitch's theorem and the Immerman-Szelepcsényi theorem do not hold in the range lg lg n to lg n. We also present other changes in the
more » ... computation model which bring out and clarify the importance of space constructibility. We conclude by enumerating open problems which arise out of the discussion.
doi:10.1007/3-540-51486-4_56 fatcat:ygieduf6zzahbaflfffs4afpfu