ALL (complexity)
In computability and complexity theory, ALL is the class of all decision problems.
Relations to other classes
ALL contains all of the complex classes of decision problems, including RE and co-RE.
External links
In computability and complexity theory, ALL is the class of all decision problems.
ALL contains all of the complex classes of decision problems, including RE and co-RE.
| Considered feasible | |
|---|---|
| Suspected infeasible | |
| Considered infeasible | |
| Class hierarchies | |
| Families of classes | |
| P ≟ NP | This theoretical computer science–related article is a stub. You can help Wikipedia by expanding it. |