<<Up     Contents

Redirected from Wpc/computationally tractable decision problem

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

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