Search the Kids Internet
Encyclopedia > Wpc computationally tractable decision problem
Article Content
Wikipedia:Wpc/computationally tractable decision problem
Redirected from Wpc/computationally tractable decision problem
|
Definition:
A decision problem for which there exists an algorithm[?] that solves it in polynomial time[?].
Equivalently, a member of complexity class P.
Specializations: None 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
|