ALL (complexity)
In computability and complexity theory, ALL is the class of all decision problems.
Relations to other classes
ALL contains all complexity classes of decision problems, including RE and co-RE.
In computability and complexity theory, ALL is the class of all decision problems.
ALL contains all complexity classes of decision problems, including RE and co-RE.
| Considered feasible | |
|---|---|
| Suspected infeasible | |
| Considered infeasible | |
| Class hierarchies | |
| Families of classes | |