Redirected from Wpc/nondeterministically computationally tractable decision problem
NP problem
A decision problem for which there exists a nondeterministic algorithm[?] that solves it in polynomial time[?].
the concept-
related field(s)- computational complexity theory
potential real-world examples-
Table of contents
1 Also known as:
2 Definition:
3 Generalizations:
4 Specializations:
5 Involved in:
6 Relevant Wikipedia Articles:
Also known as:
Definition:
Equivalently, a decision problem for which there exists an algorithm[?] to validate a purported answer in polynomial time[?], given the right information.
Equivalently, a member of complexity class NP.
Generalizations:
Specializations:
Involved in:
Relevant Wikipedia Articles:
/Discussion
| Elsewhere |
|
 |
|
© 06 eBroadcast Australia | About eBroadcast | Legal Notices | Privacy Policy | Contact Us
|  |