Complexity Class - Important Complexity Classes

Important Complexity Classes

Many important complexity classes can be defined by bounding the time or space used by the algorithm. Some important complexity classes of decision problems defined in this manner are the following:

Complexity class Model of computation Resource constraint
DTIME(f(n)) Deterministic Turing machine Time f(n)
P Deterministic Turing machine Time poly(n)
EXPTIME Deterministic Turing machine Time 2poly(n)
NTIME(f(n)) Non-deterministic Turing machine Time f(n)
NP Non-deterministic Turing machine Time poly(n)
NEXPTIME Non-deterministic Turing machine Time 2poly(n)
DSPACE(f(n)) Deterministic Turing machine Space f(n)
L Deterministic Turing machine Space O(log n)
PSPACE Deterministic Turing machine Space poly(n)
EXPSPACE Deterministic Turing machine Space 2poly(n)
NSPACE(f(n)) Non-deterministic Turing machine Space f(n)
NL Non-deterministic Turing machine Space O(log n)
NPSPACE Non-deterministic Turing machine Space poly(n)
NEXPSPACE Non-deterministic Turing machine Space 2poly(n)

It turns out that PSPACE = NPSPACE and EXPSPACE = NEXPSPACE by Savitch's theorem.

Other important complexity classes include BPP, ZPP and RP, which are defined using probabilistic Turing machines; AC and NC, which are defined using boolean circuits and BQP and QMA, which are defined using quantum Turing machines. #P is an important complexity class of counting problems (not decision problems). Classes like IP and AM are defined using Interactive proof systems. ALL is the class of all decision problems.

Read more about this topic:  Complexity Class

Famous quotes containing the words important, complexity and/or classes:

    “Which is more important to you, your field or your children?” the department head asked. She replied, “That’s like asking me if I could walk better if you amputated my right leg or my left leg.”
    —Anonymous Parent. As quoted in Women and the Work Family Dilemma, by Deborah J. Swiss and Judith P. Walker, ch. 2 (1993)

    It is not only their own need to mother that takes some women by surprise; there is also the shock of discovering the complexity of alternative child-care arrangements that have been made to sound so simple. Those for whom the intended solution is equal parenting have found that some parents are more equal than others.
    Elaine Heffner (20th century)

    Intellectuals can tell themselves anything, sell themselves any bill of goods, which is why they were so often patsies for the ruling classes in nineteenth-century France and England, or twentieth-century Russia and America.
    Lillian Hellman (1907–1984)