Bridging across the log(n) Space Frontier

Information and Computation

Volumn 142, Issue 2, 1998, Pages 127-158

  Geffert, Viliam ^a  

^a P J AFÁRIK UNIVERSITY   (Slovakia)

Author keywords

Space complexity; Structural complexity; Turing machines

Indexed keywords

EID: 0013275182     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1997.2682     Document Type: Article

References (31)

1. Albers, M. (1985), Space complexity of alternating Turing machines, in "Proc. Fund. Comput. Theory," Lecture Notes in Computer Science, Vol. 199, pp. 1-7, Springer-Verlag, Berlin/New York.
2. Alt, H., Geffert, V., and Mehlhorn, K. (1992), A lower bound for the nondeterministic space complexity of context-free recognition, Inform. Process. Lett. 42, 25-27.
3. Alt, H., and Mehlhorn, K. (1975), A language over a one symbol alphabet requiring only O(log log n) space, SIGACT News 7, 31-33.
4. Bertoni, A., Mereghetti, C., and Pighizzini, G. (1994), An optimal lower bound for nonregular languages, Inform. Process. Lett. 50, 289-292. [Corrigendum: Inform. Process. Lett. (1994), 52, 339.]
5. Bertoni, A., Mereghetti, C., and Pighizzini, G. (1995), Strong optimal lower bounds for Turing machines that accept nonregular languages, in "Proc. Math. Found. Comput. Sci.," Lecture Notes in Computer Science, Vol. 969, pp. 309-318, Springer-Verlag, Berlin/New York.
6. von Braunmühl, B., Gengler, R., and Rettinger, R. (1993), The alternation hierarchy for sublogarithmic space is infinite, Comput. Complexity 3, 207-230.
7. Chang, R., Hartmanis, J., and Ranjan, D. (1991), Space bounded computations: Review and new separation results, Theoret. Comput. Sci. 80, 289-302.
8. Damm, C., and Holzer, M. (1996), Inductive counting for width-restricted branching programs, Inform. and Comput. 130, 91-99.
9. Freedman, A. R., and Ladner, R. E. (1975), Space bounds for processing contentless inputs, J. Comput. System Sci. 11, 118-128.
10. Geffert, V. (1991), Nondeterministic computations in sublogarithmic space and space constructibility, SIAM J. Comput. 20, 484-498.
11. 2-SPACE is not closed under complement and other separation results, RAIRO Inform. Theor. Appl. 27, 349-366.
12. Geffert, V. (1993), Tally versions of the Savitch and Immerman-Szelepcsényi theorems for sublogarithmic space, SIAM J. Comput. 22, 102-113.
13. Geffert, V. (1994), A hierarchy that does not collapse: Alternations in low level space, RAIRO Inform. Theor. Appl. 28, 465-512.
14. Hartmanis, J. (1990), New developments in structural complexity theory, Theoret. Comput. Sci. 71, 79-93.
15. Hartmanis, J., Immerman, N., and Sewelson, W. (1985), Sparse sets in NP-P: EXPTIME versus NEXPTIME, Inform. and Control 65, 158-181.
16. Hartmanis, J., Lewis II, P. M., and Stearns, R. E. (1965), Hierarchies of memory limited computations, in "IEEE Conf. Record on Switching Circuit Theory and Logical Design," pp. 179-190, IEEE Press, New York.
17. Hopcroft, J. E., and Ullman, J. D. (1969), Some results on tape-bounded Turing machines, J. Assoc. Comput. Mach. 16, 168-177.
18. Hopcroft, J. E., and Ullman, J. D. (1979), "Introduction to Automata Theory, Languages, and Computation," Addison-Wesley, Reading, MA.
19. Immerman, N. (1988), Nondeterministic space is closed under complementation, SIAM J. Comput. 17, 935-938.
20. Iwama, K. (1993), ASPACE(o(log log n)) is regular, SIAM J. Comput. 22, 136-146.
21. Kirsig, B., and Lange, K. J. (1987), Separation with the Ruzzo, Simon, and Tompa relativization implies DSPACE(log n) ≠ NSPACE(log n), Inform. Process. Lett. 25, 13-15.
22. Liśkiewicz, M., and Reischuk, R. (1993), Separating the lower levels of the sublogarithmic space hierarchy, in "Proc. Symp. Theoret. Aspects Comput. Sci.," Lecture Notes in Computer Science, Vol. 665, pp. 16-27, Springer-Verlag, Berlin/New York.
23. Liśkiewicz, M., and Reischuk, R. (1996), The sublogarithmic alternating space world, SIAM J. Comput. 25, 828-861.
24. Narkiewicz, W. (1983), "Number Theory," World Scientific, Singapore. [Translated by S. Kanemitsu]
25. Savitch, W. J. (1970), Relationships between nondeterministic and deterministic tape complexities, J. Comput. System. Sci. 4, 177-192.
26. Sipser, M. (1980), Halting space bounded computations, Theoret. Comput. Sci. 10, 335-338.
27. Szelepcsényi, R. (1988), The method of forced enumeration for nondeterministic automata, Acta Inform. 26, 279-284.
28. Szepietowski, A. (1989), Some notes on strong and weak log log n space complexity, Inform. Process. Lett. 33, 109-112.
29. Szepietowski, A. (1990), If deterministic and nondeterministic space complexities are equal for log log n then they are also equal for log n, Theoret. Comput. Sci. 74, 115-119.
30. Szepietowski, A. (1994), "Turing Machines with Sublogarithmic Space," Lecture Notes in Computer Science, Vol. 843, Springer-Verlag, Berlin/New York.
31. Yap, Ch. K., "Introduction to the Theory of Complexity Classes," Oxford Univ. Press, Oxford, in press. [Electronic version available via ftp://cs.nyu.edu/pub/local/yap/complexity-bk]