A family of problems {GAP(2dS(n))}d>0 is described that is log space complete for NSPACE(S(n)), for functions S(n) which grow less rapidly than the logarithm function. An algorithm is described to recognize GAP(2dS(n)) deterministically in space S(n) × log n. Thus, we show for constructible functions S(n), with log log n ≤ S(n) ≤ log n, that: (1) NSPACE(S(n)) ⊆ DSPACE (S(n) × log n), and (2) NSPACE(S(n)) ⊆ DSPACE (log n) iff {GAP(2dS(n))}d>0 ⊆ DSPACE (log n) In particular, when S(n) = log log n, we have: (1) NSPACE(log log n) ⊆ DSPACE(log n × log log n), and (2) NSPACE(log log n) ⊆ DSPACE(log n) iff {GAP(log n)d)}d>0 ⊆ DSPACE(log n). In addition it is shown that the question of whether NSPACE(S(n)) is identical to DSPACE(S(n)), for sublogarithmic functions S(n), is closely related to the space complexity of the graph accessibility problem for graphs with bounded bandwidth.
CITATION STYLE
Monien, B., & Sudborough, I. H. (1979). On eliminating nondeterminism from turing machines which use less than logarithm worktape space. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 71 LNCS, pp. 431–445). Springer Verlag. https://doi.org/10.1007/3-540-09510-1_34
Mendeley helps you to discover research relevant for your work.