Proceedings Article10.1109/SCT.1988.5270
Nondeterministic space is closed under complementation
Neil Immerman
- 14 Jun 1988
- pp 112-115
475
TL;DR: It is shown that nondeterministic space s(n) is closed under complementation for s( n) greater than or equal to log n and it immediately follows that the context-sensitive languages are closed under completion.
read more
Abstract: It is shown 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. The proof is an offshoot of work in first-order expressibility. >
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Logics of Programs.
Dexter Kozen,Jerzy Tiuryn +1 more
- 01 Jan 1990
TL;DR: In this paper, the authors present an introduction to some of the basic issues in the study of program logics and discuss their syntax, semantics, proof theory, and expressiveness.
520
The Nature of Computation
Cristopher Moore,Stephan Mertens +1 more
- 09 Oct 2011
TL;DR: The authors explain why the P vs. NP problem is so fundamental, and why it is so hard to resolve, and lead the reader through the complexity of mazes and games; optimization in theory and practice; randomized algorithms, interactive proofs, and pseudorandomness; Markov chains and phase transitions; and the outer reaches of quantum computing.
476
The method of forced enumeration for nondeterministic automata
TL;DR: Every family of languages, recognized by nondeterministic L(n) tape-bounded Turing machines, where L( n)≥logn, is closed under complement, and as a special case, the family of context-sensitive languages isclosed under complement.
447
GraphLog: a visual formalism for real life recursion
Mariano P. Consens,Alberto O. Mendelzon +1 more
- 02 Apr 1990
TL;DR: The expressive power of the GraphLog language is characterized and it is shown that it is equivalent to stratified linear Datalog, first order logic with transitive closure, and non-deterministic logarithmic space (assuming ordering on the domain).
409
•Book
Structural Complexity II
José L. Balcázar,Josep Díaz,Joaquim Gabarró +2 more
- 21 Dec 2011
TL;DR: This is the second volume of a systematic two-volume presentation of the various areas of research in the field of structural complexity, addressed to graduate students and researchers and assumes knowledge of the topics treated in the first volume but is otherwise nearly self-contained.
385
References
Relationships between nondeterministic and deterministic tape complexities
TL;DR: The amount of storage needed to simulate a nondeterministic tape bounded Turingmachine on a deterministic Turing machine is investigated and a specific set is produced, namely the set of all codings of threadable mazes, such that, if there is any set which distinguishes nondeter microscopic complexity classes from deterministic tape complexity classes, then this is one such set.
1.6K
A taxonomy of problems with fast parallel algorithms
TL;DR: An attempt is made to identify important subclasses of NC and give interesting examples in each subclass, and a new problem complete for deterministic polynomial time is given, namely, finding the lexicographically first maximal clique in a graph.
757
Symmetric space-bounded computation
TL;DR: Certain natural problems are shown to be complete for symmetric space complexity classes, and the relationship of symmetry to determinism and nondeterminism is investigated.
191
•Proceedings Article
Expressibility as a complexity measure: results and directions.
Neil Immerman
- 01 Jan 1987
TL;DR: This article surveys some work relating first-order expressibility to computational complexity, and presents a number of open problems.
135
Symmetric Complementation
TL;DR: Of particular interest is the complexity class ~,CSYMLOG, which contains the outcome problem of symmetric complementing games with constant complement bound with game positions encoded in log space, and next move relations computable inlog space.
80