TheBestLinks.com
TheBestLinks.com
NESPACE, Computational complexity theory, Decision problem, Non-deterministic ... Print friendly version | Tell a friend
 
Navigation
Search
Toolbox

NESPACE

From TheBestLinks.com

In computational complexity theory, the complexity class NESPACE is the set of decision problems that can be solved by a non-deterministic Turing machine in space O(2n).

This article is a stub. You can help Wikipedia by expanding it (http://www.thebestlinks.com/NESPACE-bp-action-v-edit-ep-.html).


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.
Retrieved from "http://www.thebestlinks.com/NESPACE.html"
 
   
Innovate it
This page was last modified 18:05, 31 May 2004.
  Content is available under GNU Free Documentation License 1.2.
Powered by MediaWiki