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

Generalizations:

• decision problem
• computationally intractable problem[?]

Specializations: None yet

Involved in: Nothing yet

related field(s)- computational complexity theory

potential real-world examples-

See also : Wpc