ALL

Wikipedia on Answers.com:

ALL (complexity)

Top

Home > Library > Miscellaneous > Wikipedia

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

v t e Important complexity classes (more)

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

Suspected infeasible	UP NP NP-complete NP-hard co-NP co-NP-complete AM PH 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 Arithmetic hierarchy

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

This entry is from Wikipedia, the leading user-contributed encyclopedia. It may not have been reviewed by professional editors (see full disclaimer)

Donate to Wikimedia

Help us answer these

What is the answer to all the characterictist that all insects have?

Who is all in the gastineau and where did it all start?

How do you get all of the characters in all of the modes?

What is all this juice and all this joy?

Post a question - any question - to the WikiAnswers community:

Copyrights:

Cite

Wikipedia on Answers.com This article is licensed under the Creative Commons Attribution/Share-Alike License. It uses material from the Wikipedia article ALL (complexity). Read