Space hierarchy theorem revised

Theoretical Computer Science

Volumn 295, Issue 1-3, 2003, Pages 171-187

  Geffert, Viliam ^a  

^a P J AFÁRIK UNIVERSITY   (Slovakia)

Author keywords

Computational complexity; Space complexity

Indexed keywords

COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING; RECURSIVE FUNCTIONS; THEOREM PROVING;

SPACE COMPLEXITY;

COMPUTER SCIENCE;

EID: 0037463537     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00402-4     Document Type: Conference Paper

References (23)

1. Berman L., Hartmanis J. On tape bounds for single-letter alphabet language processing. Theoret. Comput. Sci. 3:1976;213-224.
2. A. Bertoni, C. Mereghetti, G. Pighizzini, Strong optimal lower bounds for Turing machines that accept nonregular languages, in: Proceedings of the Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, Vol. 969, Springer, Berlin, 1995, pp. 309-318.
3. von Braunmühl B., Gengler R., Rettinger R. The alternation hierarchy for sublogarithmic space is infinite. Comput. Complexity. 3:1993;207-230.
4. Chang R., Hartmanis J., Ranjan D. Space bounded computations. review and new separation results Theoret. Comput. Sci. 80:1991;289-302.
5. Fortnow L. Diagonalization. Bull. Eur. Assoc. Theoret. Comput. Sci. 71:2000;102-112.
6. Freedman A.R., Ladner R.E. Space bounds for processing contentless inputs. J. Comput. System Sci. 11:1975;118-128.
7. Geffert V. Nondeterministic computations in sublogarithmic space and space constructibility. SIAM J. Comput. 20:1991;484-498.
8. Geffert V. Tally versions of the Savitch and Immerman-Szelepcsényi theorems for sublogarithmic space. SIAM J. Comput. 22:1993;102-113.
9. Geffert V. A hierarchy that does not collapse. alternations in low level space RAIRO Inform. Théor. 28:1994;465-512.
10. V. Geffert, Bridging across the log(n) space frontier, Inform. and Comput. 142 (1998) 127-158. (Conference version in: Proceedings of the Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, Vol. 969, Springer, Berlin, 1995, pp. 50-65).
11. V. Geffert, Bridging across the log(n) space frontier, Inform. and Comput. 142 (1998) 127-158. (Conference version in: Proceedings of the Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, Vol. 969, Springer, Berlin, 1995, pp. 50-65).
12. J. Hartmanis, P.M. Lewis II, R.E. Stearns, Hierarchies of memory limited computations, in: IEEE Conference Record on Switching Circuit Theory and Logical Design, 1965, pp. 179-190.
13. Hopcroft J.E., Ullman J.D. Some results on tape-bounded Turing machines. J. Assoc. Comput. Mach. 16:1969;168-177.
14. Ibarra O.H. A note concerning nondeterministic tape complexities. J. Assoc. Comput. Mach. 19:1972;608-612.
15. Immerman N. Nondeterministic space is closed under complementation. SIAM J. Comput. 17:1988;935-938.
16. Liśkiewicz M., Reischuk R. The sublogarithmic alternating space world. SIAM J. Comput. 25:1996;828-861.
17. Savitch W.J. Relationships between nondeterministic and deterministic tape complexities. J. Comput. System Sci. 4:1970;177-192.
18. Seiferas J., Fischer M., Meyer A. Separating nondeterministic time complexity classes. J. Assoc. Comput. Mach. 25:1978;146-167.
19. Sipser M. Halting space bounded computations. Theoret. Comput. Sci. 10:1980;335-338.
20. Szelepcsényi R. The method of forced enumeration for nondeterministic automata. Acta Inform. 26:1988;279-284.
21. Szepietowski A. Turing Machines with Sublogarithmic Space. Lecture Notes in Computer Science. Vol. 843:1994;Springer, Berlin.
22. Žák S. A turing machine time hierarchy. Theoret. Comput. Sci. 26:1983;327-333.
23. S. Žák, A sharp separation below log(n) , Tech. Report 655/1995, Inst. Comput. Sci., Czech Academy of Sciences, 1995.