From TheBestLinks.com
In computational complexity theory, the complexity class DSPACE(f(n)) or SPACE(f(n)) is the set of decision problems that can be solved by a deterministic Turing machine using space O(f(n)), and unlimited time. It is the deterministic counterpart of NSPACE.
The complexity class PSPACE can be defined in terms of DSPACE as follows:
- <math>\mbox{PSPACE} = \bigcup_{k\in\mathbb{N}} \mbox{DSPACE}(n^k)<math>
es:DSPACE
Related links
Top visited
0 of
0 links
[no links posted yet]
>> place link >>
Discussion
Last posted
0 of
0 messages
[no messages posted yet]
>> post message >>
Watch
You can
add this article to your own "watchlist" and receive e-mail notification about all changes in this page.
