Neil Immerman. Nondeterministic space is closed under complementation. SIAM Journal of Computing, 17(5):935--938, 1988. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Appendix A Pattern Library - This Appendix Lists (Correct)
No context found.
Neil Immerman. Nondeterministic space is closed under complementation. SIAM Journal of Computing, 17(5):935--938, 1988.
Lightweight Structure in Text - Robert Miller May (Correct)
No context found.
Neil Immerman. Nondeterministic space is closed under complementation. SIAM Journal of Computing, 17(5):935--938, 1988.
A Note on Read-k Times Branching Programs - Jukna (1992) (4 citations) (Correct)
No context found.
N. Immerman, Nondeterministic space is closed under complementation, SIAM J. Comput., 17 (1988), 935-938.
Nonuniform Hard Boolean Functions and Uniform Complexity Classes - Kabanets (2001) (Correct)
No context found.
N. Immerman. Nondeterministic space is closed under complementation. SIAM Journal on Computing, 17(5):935-938, 1988.
Minimal Covers of Formal Languages - Domaratzki (2001) (Correct)
No context found.
N. Immerman. Nondeterministic space is closed under complementation. SIAM J. Comput., 17:935--938, 1988.
A second-order theory for NL - Stephen Cook And (2004) (Correct)
No context found.
Immerman. Nondeterministic space is closed under complementation. In SCT: Annual Conference on Structure in Complexity Theory, 1988.
CS278: Computational Complexity - Spring These Are (Correct)
No context found.
N. Immerman. Nondeterministic space is closed under complementation. SIAM Journal on Computing, 17:935--938, 1988.
Symmetric Logspace is Closed under Complement - Nisan, al. (1995) (24 citations) (Correct)
No context found.
N. Immerman. Nondeterministic space is closed under complementation. SIAM Journal on Computing, 17, 1988.
On Lower Bounds for Read-k-Times - Borodin, Razborov, Smolensky (Correct)
No context found.
N. Immerman. Nondeterministic space is closed under complementation. SIAM J. Comput., 17:935-938, 1988.
Interactive Verification of co-NP Statements - March In This (Correct)
No context found.
N. Immerman. "Nondeterministic space is closed under complementation ". SIAM J. Computing, 17, 935--938, 1988.
Complexity Theory - Allender, Loui, Regan (2004) (Correct)
No context found.
Immerman, N. 1988. Nondeterministic space is closed under complementation. SIAM J. Comput. , 17(5):935--938.
Complexity Classes - Allender, Loui, Regan (Correct)
No context found.
N. Immerman. Nondeterministic space is closed under complementation. SIAM J. Comput., 17:935--938, 1988.
Making Nondeterminism Unambiguous - Reinhardt, Allender (1997) (5 citations) (Correct)
No context found.
N. Immerman. Nondeterministic space is closed under complement. SIAM Journal on Computing, 17:935--938, 1988.
The Log Space Oracle Hierarchy Collapses - Buss, Cook, Dymond, Hay (1987) (1 citation) (Correct)
No context found.
Neil Immerman. Nondeterministic Space is Closed Under Complement. Technical Report DCS/TR 552, Yale University, July,1987.
Negation and Inductive Norms - McColm (2003) (Correct)
No context found.
N. Immerman, "Nondeterministic Space is Closed under Complementation," SIAM J. Comput. 37:5 (1988), 935 -- 938, MR 90a:68029.
Refining Randomness - Ta-Shma (1996) (Correct)
No context found.
N. Immerman. Nondeterministic space is closed under complementation. SIAM Journal on Computing, 17, 1988.
Lower Bounds for Deterministic and Nondeterministic Branching.. - Razborov (1991) (50 citations) (Correct)
No context found.
N. Immerman. Nondeterministic space is closed under complementation. In Proceedings of the
An Attempt to Automate NP-Hardness Reductions via SO∃ Logic - Nijjar (2004) (Correct)
No context found.
Neil Immerman. Nondeterministic space is closed under complementation. SIAM Journal of Computing, 17(5):935--938, 1988.
NL-printable sets and Nondeterministic Kolmogorov Complexity - Allender (2004) (Correct)
No context found.
Neil Immerman. Nondeterministic space is closed under complementation. SIAM Journal on Computing, 17(5):935--938, October 1988.
Computation in Networks of Passively Mobile.. - Angluin, Aspnes.. (2004) (Correct)
No context found.
N. Immerman. Nondeterministic space is closed under complementation. SIAM J. Comput., 17(5):935--938, Oct. 1988.
Theories for Complexity Classes and their Propositional Translations - Cook (2004) (Correct)
No context found.
N. Immerman. Nondeterministic space is closed under complementation. In SCT: Annual Conference on Structure in Complexity Theory, 1988.
Lecture Notes on Computational Complexity - Trevisan (2004) (Correct)
No context found.
N. Immerman. Nondeterministic space is closed under complementation. SIAM Journal on Computing, 17:935--938, 1988. 166
Characterizing Small Depth and Small Space Classes .. - Agrawal.. (Correct)
No context found.
N. Immerman. Nondeterministic space is closed under complementation. SIAM Journal on Computing, 17:935--938, 1988.
The Complexity of Planarity Testing - Allender, Mahajan (2003) (1 citation) (Correct)
No context found.
Neil Immerman. Nondeterministic space is closed under complementation. SIAM Journal on Computing, 17(5):935--938, Oct 1988.
The Boolean Hierarchy over Level 1/2 of the.. - Schmitz, Wagner (Correct)
No context found.
N. Immerman. Nondeterministic space is closed under complementation. SIAM Journal on Computing, 17:935--938, 1988.
First 50 documents Next 50
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