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