ALL (complexity)
Jump to navigation
Jump to search
In computability and complexity theory, ALL is the class of all decision problems.
Relations to other classes[edit]
ALL contains all of the complex classes of decision problems, including RE and co-RE.
External links[edit]
| P ≟ NP | This theoretical computer science–related article is a stub. You can help Wikipedia by expanding it. |
