Search the Kids Internet
Encyclopedia > Wikipedia:Wpc NP tcs
Article Content
Wikipedia:Wpc/NP tcs
|
Definition: The decision complexity class which includes all nondeterministically computationally tractable problems[?] (and not any other problem).
Specializations: None yet
Relevant Wikipedia Articles: the concept- complexity classes P and NP
related field(s)- computational complexity theory
potential real-world examples-
/Discussion
- See also : Wpc
All Wikipedia text is available under the terms of the GNU Free Documentation License
|
Search Encyclopedia
|
Featured Article
|