Wikipedia:Wpc/computationally tractable problem

Table of contents 1 Definition: 2 Generalizations: 3 Specializations: 4 Involved in: 5 Relevant Wikipedia Articles:

Definition:

A computational problem for which there exists an algorithm[?] that solves it in polynomial time[?].

Generalizations:

• problem

Specializations:

• computationally tractable decision problem
• computationally intractable decision problem

Involved in:

Nothing yet

---

Relevant Wikipedia Articles:

the concept-

related field(s)- computational complexity theory

potential real-world examples-

---

/Discussion

See also : Wpc