ALL (complexity)
In computability and complexity theory, ALL is the class of all decision problems.
Relations to other classes
ALL contains all complexity classes, including RE and Co-RE.
 | This article is an orphan, as no other articles link to it. Please introduce links to this page from related articles; try the Find link tool for suggestions. (December 2008) |
In computability and complexity theory, ALL is the class of all decision problems.
ALL contains all complexity classes, including RE and Co-RE.
| Considered feasible | |
|---|---|
| Suspected infeasible | |
| Considered infeasible | |
| Class hierarchies | |
| Families of classes | |