Skip to search formSkip to main contentSkip to account menu

NSPACE

Known as: Nondeterministic space 
In computational complexity theory, non-deterministic space or NSPACE is the computational resource describing the memory space for a non… 
Wikipedia (opens in a new tab)

Related topics

Related topics

24 relations
AlgorithmComplexity classComputational complexity theoryComputational problem

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2003
2003
NL-printable sets and Nondeterministic Kolmogorov Complexity
1997
1997
On the Complexity of Iterated Insertions
We investigate complexities of insertion operations on formal languages relatively to complexity classes. In this way, we… 
1995
1995
On the Power of One-Way Globally Deterministic Synchronized Alternating Turing Maschines and Multihead Automata
The alternating model augmented by a special simple form of communication among parallel processes—the so-called synchronized… 
1992
1992
A Lower Bound for the Nondeterministic Space Complexity of Context-Free Recognition
1991
1991
Almost-Everywhere Complexity, Bi-Immunity and Nondeterministic Space
We show that the complexity-theoretic notion of almost-everywhere complex functions is identical to the recursion-theoretic… 
1990
1990
One-Way Globally Deterministic Synchronized Alternating Finite Automata Recognize Exactly Deterministic Context-Sensitive Languages
1988
1988
Two applications of complementation via inductive counting
A recent proof that nondeterministic space-bounded complexity classes are closed under complementation is used to develop two… 
1983
1983
Lower bounds on graph threading by probabilistic machines
It is likely that reliable and fast space-bounded probabilistic acceptors are less powerful than nondeterministic ones. We… 
1981
1981
On the number of P-isomorphism classes of NP-complete sets
  • Stephen R. Mahaney
  • 22nd Annual Symposium on Foundations of Computer…
  • 1981
  • Corpus ID: 846753
All known NP-complete sets are P-isomorphic (i.e. there are polynomial time, one-to-one and onto, polynomial time invertible… 
1980
1980
Symmetric Space-Bounded Computation (Extended Abstract)
A symmetric Turing machine is one whose "yields" relation between configurations is symmetric. The space complexity classes for… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)