A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
The Sublogarithmic Alternating Space World
1996
SIAM journal on computing (Print)
This paper tries to fully characterize the properties and relationships of space classes defined by Turing machines that use less than logarithmic space -may they be deterministic, nondeterministic or alternating (DTM, NTM or ATM). We provide several examples of specific languages and show that such machines are unable to accept these languages. The basic proof method is a nontrivial extension of the 1 n → 1 n+n! technique to alternating TMs. Let llog denote the logarithmic function log
doi:10.1137/s0097539793252444
fatcat:csvph7zvnjc3pa2oiyazr4uyri