Non User
Index: >
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
Business
Non User
Industries
Finance
Tax
Home
> NSPACE
In
computational complexity theory
, the
complexity class
NSPACE(f(n))
is the set of
decision problem
s that can be solved by a
non-deterministic Turing machine
using space O(f(n)), and unlimited time. It is the non-deterministic counterpart of
DSPACE
.
The complexity class
NPSPACE
can be defined in terms of NSPACE as follows:
Complexity classes
Non User
