Redirected from Wpc/computationally tractable problem
|
Definition:
A computational problem for which there exists an algorithm[?] that solves it in polynomial time[?].
Involved in: Nothing yet
related field(s)- computational complexity theory
potential real-world examples-
Search Encyclopedia
|
Featured Article
|