Separating the lower levels of the sublogarithmic space hierarchy

8Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

For S(n) ≥ log n it is well known that the complexity classes NSPACE(S) are closed under complementation. Furthermore, the corresponding alternating space hierarchy collapses to the first level. Till now, it is an open problem if these results hold for space complexity bounds between log log n and log n, too. In this paper we give some partial answer to this question. We show that for each S between log log n and log n, Σ2SPACE(S) and Σ3SPACE(S) are not closed under complement. This implies the hierarchy (formula presented). We also compare the power of weak and strong sublogarithmic space bounded ATMs.

Cite

CITATION STYLE

APA

Liśkiewicz, M., & Reischuk, R. (1993). Separating the lower levels of the sublogarithmic space hierarchy. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 665 LNCS, pp. 16–27). Springer Verlag. https://doi.org/10.1007/3-540-56503-5_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free