Neil Immerman  Home/Search
Context Related
Links: ACM DBLP | umass.edu/~immerman/pub/space.ps umass.edu/pub/theory/immerma...space.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: umass.edu/~immerma...pub_immerman (more) From: umass.edu (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper we show that nondeterministic space s(n) is closed under complementation, for s(n) greater than or equal to log n. It immediately follows that the context-sensitive languages are closed under complementation, thus settling a question raised by Kuroda in 1964 [9]. See Hartmanis and Hunt [4] for a discussion of the history and importance of this problem, and Hopcroft and Ullman [5] for all relevant background material and definitions. The history behind the proof is as follows. In 1981 ... (Update)
Cited by: More
Appendix A Pattern Library - This Appendix Lists (Correct)
Lightweight Structure in Text - Robert Miller May (Correct)
A Note on Read-k Times Branching Programs - Jukna (1992) (Correct)
Active bibliography (related documents): More All
0.4: Descriptive and Computational Complexity - Immerman (1989) (Correct)
0.3: Trading Space for Time in Undirected s-t Connectivity - Broder, Karlin, Raghavan.. (1991) (Correct)
0.1: Nondeterminism, Fairness and a Fundamental Analogy - Spaan, Torenvliet, Boas (Correct)
Similar documents based on text: More All
0.2: Complementation of Büchi Automata Revisited - Thomas (Correct)
0.2: NL-printable sets and Nondeterministic Kolmogorov Complexity - Allender (2003) (Correct)
0.2: The Log Space Oracle Hierarchy Collapses - Buss, Cook, Dymond, Hay (1987) (Correct)
Related documents from co-citation: More All
30: Languages that capture complexity classes - Immerman - 1987
27: The method of forced enumeration for nondeterministic automata (context) - Szelepcs'enyi - 1988
21: The method of forcing for nondeterministic automata (context) - Szelepcs'enyi - 1988
BibTeX entry: (Update)
N. Immerman. Nondeterministic space is closed under complementation. SIAM Journal on Computing, 17(5):935--938, Oct. 1988. http://citeseer.ist.psu.edu/82633.html More
@article{ immerman88nondeterministic,
author = "Neil Immerman",
title = "Nondeterministic Space is Closed Under Complementation",
journal = "SIAM J. Comput.",
volume = "17",
number = "5",
pages = "935-938",
year = "1988",
url = "citeseer.ist.psu.edu/82633.html" }
Citations (may not include all citations):168 A Taxonomy of Problems with Fast Parallel Algorithms (context) - Cook - 1985 ACM DBLP
132 Relationships Between Nondeterministic and Deterministic Tap.. (context) - Savitch - 1970 DBLP
70 Sparse Complete Sets for NP: Solution of a Conjecture of Ber.. (context) - Mahaney - 1982 DBLP
29 The Method of Forcing for Nondeterministic Automata (context) - Szelepcs'enyi - 1987
17 Symmetric Complementation (context) - Reif - 1984 ACM DBLP
14 Classes of Languages and Linear-Bounded Automata (context) - Kuroda - 1964 DBLP
3 Two Applications of Complementation via Inductive Counting (context) - Borodin, Cook et al.
1 Introdution to Automata Theory (context) - Hopcroft, Ullman - 1979
1 Sigma 2 SPACE(n) is Closed Under Complement (context) - Toda - 1987
1 The Logarithmic Hierarchy Collapses: A\Sigma L 2 = A\Pi L 2 (context) - Lange, Jenner et al. - 1987
1 The LBA Problem (context) - Hartmanis, Hunt - 1974
1 The Log Space Oracle Hierarchy Collapses - Buss, Cook et al.
1 Collapsing Oracles, Census Functions, and Logarithmically Ma.. (context) - Schoning, Wagner - 1987
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.umass.edu/~immerman/pub_immerman.html): More
Describing Graphs: a First-Order Approach to Graph Canonization - Immerman, Lander (1990) (Correct)
Expressibility And Parallel Complexity - Immerman (1989) (Correct)
Descriptive and Computational Complexity - Immerman (1989) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC