Wikipedia: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.

Generalizations:

• nondeterministically computationally tractable decision problem
• computationally tractable problem

Specializations: None yet

Involved in:

• P

related field(s)- computational complexity theory

potential real-world examples-

See also : Wpc