Search the Kids Internet
Encyclopedia > Wpc computationally intractable decision problem
Article Content
Wikipedia:Wpc/computationally intractable decision problem
Redirected from Wpc/computationally intractable decision problem
|
Definition:
A decision problem for which there does not exist an algorithm[?] that solves it in polynomial time[?].
Equivalently, a decision problem that is not in complexity class P.
Specializations: None yet
Involved in: Nothing yet
Relevant Wikipedia Articles: the concept-
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
|