Also known as ALL complexity class
class of all decision problems
In the Vinony graph
Within Vinony's link graph, ALL is referenced by 76 other articles, and connects out to RE, theoretical computer science and computability theory.
It sits within the topics Complexity classes and Undecidable problems.
Its subject is documented across 8 Wikipedia language editions.
Wikidata facts
- Instance of
- universe
- Subclass of
- computational problem
- Has part
- RE
Show 2 more facts
- different from
- ALL
- facet of
- computational complexity theory
Sources (1)
via Wikidata · CC0
Connections
RE
Entity
theoretical computer science
Entity
computability theory
Entity
computational complexity theory
Entity
NP-complete
Entity
NP
Entity
decision problem
Entity
P
Entity
regular language
Entity
NP-hard
Entity
complexity class
Entity
PSPACE
Entity
NL
Entity
co-NP
Entity
EXPTIME
Entity
L
Entity
BPP
Entity
RP
Entity
polynomial hierarchy
Entity
Scott Aaronson
Entity