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.

External links

Complexity Zoo: Class ALL

Important complexity classes (more)

Considered feasible	DLOGTIME AC⁰ ACC⁰ TC⁰ L SL RL NL NC SC CC P P-complete ZPP RP BPP BQP APX

Suspected infeasible	UP NP NP-complete NP-hard co-NP co-NP-complete AM QMA PH ⊕P PP #P #P-complete IP PSPACE PSPACE-complete

Considered infeasible	EXPTIME NEXPTIME EXPSPACE ELEMENTARY PR R RE ALL

Class hierarchies	Polynomial hierarchy Exponential hierarchy Grzegorczyk hierarchy Arithmetical hierarchy Boolean hierarchy

Families of classes	DTIME NTIME DSPACE NSPACE Probabilistically checkable proof Interactive proof system

This article is issued from Wikipedia - version of the Tuesday, September 01, 2015. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.