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

---

Relevant Wikipedia Articles:

the concept-

related field(s)- complexity theory

potential real-world examples-

---

/Discussion?