|
|
| (One intermediate revision by one other user not shown) |
| Line 1: |
Line 1: |
| In [[computational complexity theory]], a '''complexity class''' is a set of [[Computational problem|problems]] of related resource-based complexity. A typical complexity class has a definition of the form:
| | Howdy. The [http://Www.Thefreedictionary.com/author%27s author's] name is Eusebio remember, though , he never really enjoyed that name. The hobby for him and after that his kids is to finally drive and he's [http://imageshack.us/photos/started started] doing it for quite a while. Auditing is how he supports your man's family. Massachusetts is where he and his wife live comfortably. He's been working in his website for some time now. Check one out here: http://circuspartypanama.com<br><br> |
|
| |
|
| :the set of problems that can be solved by an [[abstract machine]] M using [[Big O notation|O]](f(''n'')) of [[computational resource|resource]] R, where ''n'' is the size of the input.
| | Also visit my blog post ... clash of clans cheats [[http://circuspartypanama.com relevant internet site]] |
| | |
| For example, the class '''[[NP (complexity)|NP]]''' is the set of [[decision problem]]s whose solutions can be determined by a [[non-deterministic Turing machine]] in [[polynomial time]], while the class '''[[PSPACE]]''' is the set of decision problems that can be solved by a [[deterministic Turing machine]] in [[polynomial space]].
| |
| | |
| The simpler complexity classes are defined by the following factors:
| |
| * The type of computational problem: The most commonly used problems are [[decision problem]]s. However, complexity classes can be defined based on [[function problem]]s (an example is '''[[FP (complexity)|FP]]'''), [[counting problem (complexity)|counting problem]]s (e.g. '''[[Sharp-P|#P]]'''), [[optimization problem]]s, [[promise problem]]s, etc.
| |
| * The model of computation: The most common model of computation is the deterministic Turing machine, but many complexity classes are based on [[nondeterministic Turing machine]]s, [[boolean circuit]]s, [[quantum Turing machine]]s, [[monotone circuit]]s, etc.
| |
| * The resource (or resources) that are being bounded and the bounds: These two properties are usually stated together, such as "polynomial time", "logarithmic space", "constant depth", etc.
| |
| | |
| Many complexity classes can be characterized in terms of the [[mathematical logic]] needed to express them; see [[descriptive complexity]].
| |
| | |
| Bounding the computation time above by some concrete function ''f''(''n'') often yields complexity classes that depend on the chosen machine model. For instance, the language {''xx'' | ''x'' is any binary string} can be solved in [[linear time]] on a multi-tape Turing machine, but necessarily requires quadratic time in the model of single-tape Turing machines. If we allow polynomial variations in running time, [[Cobham's thesis|Cobham-Edmonds thesis]] states that "the time complexities in any two reasonable and general models of computation are polynomially related" {{Harv|Goldreich|2008|loc=Chapter 1.2}}. This forms the basis for the complexity class [[P (complexity)|P]], which is the set of decision problems solvable by a deterministic Turing machine within polynomial time. The corresponding set of function problems is [[FP (complexity)|FP]].
| |
| | |
| The [[Blum axioms]] can be used to define complexity classes without referring to a concrete [[computational model]].
| |
| | |
| ==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:
| |
| | |
| {| class="wikitable"
| |
| |-
| |
| | |
| ! Complexity class
| |
| | |
| ! Model of computation
| |
| | |
| ! Resource constraint
| |
| |-
| |
| | [[DTIME]](''f''(''n''))
| |
| | Deterministic Turing machine
| |
| | Time ''f''(''n'')
| |
| |-
| |
| | [[P (complexity)|P]]
| |
| | Deterministic Turing machine
| |
| | Time poly(''n'')
| |
| |-
| |
| | [[EXPTIME]]
| |
| | Deterministic Turing machine
| |
| | Time 2<sup>poly(''n'')</sup>
| |
| |-
| |
| | [[NTIME]](''f''(''n''))
| |
| | Non-deterministic Turing machine
| |
| | Time ''f''(''n'')
| |
| |-
| |
| | [[NP (complexity)|NP]]
| |
| | Non-deterministic Turing machine
| |
| | Time poly(''n'')
| |
| |-
| |
| | [[NEXPTIME]]
| |
| | Non-deterministic Turing machine
| |
| | Time 2<sup>poly(''n'')</sup>
| |
| |-
| |
| | [[DSPACE]](''f''(''n''))
| |
| | Deterministic Turing machine
| |
| | Space ''f''(''n'')
| |
| |-
| |
| | [[L (complexity)|L]]
| |
| | Deterministic Turing machine
| |
| | Space O(log ''n'')
| |
| |-
| |
| | [[PSPACE]]
| |
| | Deterministic Turing machine
| |
| | Space poly(''n'')
| |
| |-
| |
| | [[EXPSPACE]]
| |
| | Deterministic Turing machine
| |
| | Space 2<sup>poly(''n'')</sup>
| |
| |-
| |
| | [[NSPACE]](''f''(''n''))
| |
| | Non-deterministic Turing machine
| |
| | Space ''f''(''n'')
| |
| |-
| |
| | [[NL (complexity)|NL]]
| |
| | Non-deterministic Turing machine
| |
| | Space O(log ''n'')
| |
| |-
| |
| | [[NPSPACE]]
| |
| | Non-deterministic Turing machine
| |
| | Space poly(''n'')
| |
| |-
| |
| | [[NEXPSPACE]]
| |
| | Non-deterministic Turing machine
| |
| | Space 2<sup>poly(''n'')</sup>
| |
| |}
| |
| | |
| It turns out that PSPACE = NPSPACE and EXPSPACE = NEXPSPACE by [[Savitch's theorem]].
| |
| | |
| Other important complexity classes include [[Bounded-error probabilistic polynomial|BPP]], [[ZPP (complexity)|ZPP]] and [[RP (complexity)|RP]], which are defined using [[probabilistic Turing machine]]s; [[AC (complexity)|AC]] and [[NC (complexity)|NC]], which are defined using boolean circuits and [[BQP]] and [[QMA]], which are defined using quantum Turing machines. [[Sharp-P|#P]] is an important complexity class of counting problems (not decision problems). Classes like [[IP (complexity)|IP]] and [[AM (complexity)|AM]] are defined using [[Interactive proof system]]s. [[ALL (complexity)|ALL]] is the class of all decision problems.
| |
| | |
| ==Reduction==
| |
| {{main|Reduction (complexity)}}
| |
| Many complexity classes are defined using the concept of a reduction. A reduction is a transformation of one problem into another problem. It captures the informal notion of a problem being at least as difficult as another problem. For instance, if a problem ''X'' can be solved using an algorithm for ''Y'', ''X'' is no more difficult than ''Y'', and we say that ''X'' ''reduces'' to ''Y''. There are many different types of reductions, based on the method of reduction, such as Cook reductions, Karp reductions and Levin reductions, and the bound on the complexity of reductions, such as [[polynomial-time reduction]]s or [[log-space reduction]]s.
| |
| | |
| The most commonly used reduction is a polynomial-time reduction. This means that the reduction process takes polynomial time. For example, the problem of squaring an integer can be reduced to the problem of multiplying two integers. This means an algorithm for multiplying two integers can be used to square an integer. Indeed, this can be done by giving the same input to both inputs of the multiplication algorithm. Thus we see that squaring is not more difficult than multiplication, since squaring can be reduced to multiplication.
| |
| | |
| This motivates the concept of a problem being hard for a complexity class. A problem ''X'' is ''hard'' for a class of problems ''C'' if every problem in ''C'' can be reduced to ''X''. Thus no problem in ''C'' is harder than ''X'', since an algorithm for ''X'' allows us to solve any problem in ''C''. Of course, the notion of hard problems depends on the type of reduction being used. For complexity classes larger than P, polynomial-time reductions are commonly used. In particular, the set of problems that are hard for NP is the set of [[NP-hard]] problems.
| |
| | |
| If a problem ''X'' is in ''C'' and hard for ''C'', then ''X'' is said to be ''[[complete (complexity)|complete]]'' for ''C''. This means that ''X'' is the hardest problem in ''C'' (Since there could be many problems which are equally hard, one might say that ''X'' is one of the hardest problems in ''C''). Thus the class of [[NP-complete]] problems contains the most difficult problems in NP, in the sense that they are the ones most likely not to be in P. Because the problem P = NP is not solved, being able to reduce another problem, Π<sub>1</sub>, to a known NP-complete problem, Π<sub>2</sub>, would indicate that there is no known polynomial-time solution for Π<sub>1</sub>. This is because a polynomial-time solution to Π<sub>1</sub> would yield a polynomial-time solution to Π<sub>2</sub>. Similarly, because all NP problems can be reduced to the set, finding an [[NP-complete]] problem that can be solved in polynomial time would mean that P = NP.
| |
| | |
| ==Closure properties of classes==
| |
| Complexity classes have a variety of closure properties; for example, decision classes may be closed under [[negation]], [[disjunction]], [[Logical conjunction|conjunction]], or even under all [[Logical connective|Boolean operations]]. Moreover, they might also be closed under a variety of quantification schemes. '''P''', for instance, is closed under all Boolean operations, and under quantification over polynomially sized domains. However, it is most likely not closed under quantification over exponential sized domains.
| |
| | |
| Each class '''X''' that is not closed under negation has a complement class '''co-Y''', which consists of the complements of the languages contained in '''X'''. Similarly one can define the Boolean closure of a class, and so on; this is however less commonly done.
| |
| | |
| One possible route to separating two complexity classes is to find some closure property possessed by one and not by the other.
| |
| | |
| ==Relationships between complexity classes==
| |
| | |
| The following table shows some of the classes of problems (or languages, or grammars) that are considered in complexity theory. If class '''X''' is a strict [[subset]] of '''Y''', then '''X''' is shown below '''Y''', with a dark line connecting them. If '''X''' is a subset, but it is unknown whether they are equal sets, then the line is lighter and is dotted. Technically, the breakdown into decidable and undecidable pertains more to the study of [[computability theory]] but is useful for putting the complexity classes in perspective.
| |
| {| cellpadding="0" cellspacing="0" border="0" style="margin:auto;"
| |
| |- style="text-align:center;"
| |
| | colspan=2 |
| |
| | |
| | colspan=4 |
| |
| {| cellpadding="0" cellspacing="0" border="1" style="background:lightBlue; width:100%; height:100%;"
| |
| |-
| |
| | style="text-align:center;" | [[decision problem|Decision Problem]]
| |
| |}
| |
| |- style="text-align:center;"
| |
| | colspan=2 |
| |
| | [[File:solidLine.png]]
| |
| | colspan=2 |
| |
| | [[File:solidLine.png]]
| |
| |- style="text-align:center;"
| |
| | colspan=3 |
| |
| {| cellpadding="0" cellspacing="0" border="1" style="background:lightBlue; width:100%; height:100%;"
| |
| |-
| |
| | style="text-align:center;" | [[recursively enumerable language|Type 0 (Recursively enumerable)]]
| |
| |}
| |
| |
| |
| | colspan=4 |
| |
| {| cellpadding="0" cellspacing="0" border="1" style="background:lightBlue; width:100%; height:100%;"
| |
| |-
| |
| | style="text-align:center;" | [[List of undecidable problems|Undecidable]]
| |
| |}
| |
| |- style="text-align:center;"
| |
| | colspan=3 | [[File:solidLine.png]]
| |
| |- style="text-align:center;"
| |
| | colspan=3 |
| |
| {| cellpadding="0" cellspacing="0" border="1" style="background:lightBlue; width:100%; height:100%;"
| |
| |-
| |
| | style="text-align:center;" | [[recursive language|Decidable]]
| |
| |}
| |
| |- style="text-align:center;"
| |
| | colspan=3 | [[File:solidLine.png]]
| |
| |- style="text-align:center;"
| |
| | colspan=3 |
| |
| {| cellpadding="0" cellspacing="0" border="1" style="background:lightGreen; width:100%; height:100%;"
| |
| |-
| |
| | style="text-align:center;" | [[EXPSPACE]]
| |
| |}
| |
| |- style="text-align:center;"
| |
| | colspan=3 | [[File:dottedLine.png]]
| |
| |- style="text-align:center;"
| |
| | colspan=3 |
| |
| {| cellpadding="0" cellspacing="0" border="1" style="background:lightGreen; width:100%; height:100%;"
| |
| |-
| |
| | style="text-align:center;" | [[NEXPTIME]]
| |
| |}
| |
| |- style="text-align:center;"
| |
| | colspan=3 | [[File:dottedLine.png]]
| |
| |- style="text-align:center;"
| |
| | colspan=3 |
| |
| {| cellpadding="0" cellspacing="0" border="1" style="background:lightGreen; width:100%; height:100%;"
| |
| |-
| |
| | style="text-align:center;" | [[EXPTIME]]
| |
| |}
| |
| |- style="text-align:center;"
| |
| | colspan=3 | [[File:dottedLine.png]]
| |
| |- style="text-align:center;"
| |
| | colspan=8 |
| |
| {| cellpadding="0" cellspacing="0" border="1" style="background:lightGreen; width:100%; height:100%;"
| |
| |-
| |
| | style="text-align:center;" | [[PSPACE]]
| |
| |}
| |
| |- style="text-align:center;"
| |
| | [[File:solidLine.png]]
| |
| | width=40 | [[File:solidLine.png]]
| |
| | [[File:dottedLine.png]]
| |
| | [[File:dottedLine.png]]
| |
| |
| |
| | [[File:dottedLine.png]]
| |
| |- style="text-align:center;"
| |
| |
| |
| {| cellpadding="0" cellspacing="0" border="1" style="background:lightBlue; width:100%; height:100%;"
| |
| |-
| |
| | style="text-align:center;" | [[context-sensitive grammar|Type 1 (Context Sensitive)]]
| |
| |}
| |
| | [[File:solidLine.png]]
| |
| | [[File:dottedLine.png]]
| |
| | border="1" | [[File:dottedLine.png]]
| |
| |
| |
| | [[File:dottedLine.png]]
| |
| |- style="text-align:center;"
| |
| | [[File:solidLine.png]]
| |
| | [[File:solidLine.png]]
| |
| | [[File:dottedLine.png]]
| |
| | [[File:dottedLine.png]]
| |
| |
| |
| | [[File:dottedLine.png]]
| |
| |- style="text-align:center;"
| |
| | [[File:solidLine.png]]
| |
| | [[File:solidLine.png]]
| |
| |
| |
| {| cellpadding="0" cellspacing="0" border="1" style="background:lightGreen; width:100%; height:100%;"
| |
| |-
| |
| | style="text-align:center;" | [[co-NP]]
| |
| |}
| |
| |
| |
| {| cellpadding="0" cellspacing="0" border="1" style="background:lightGreen; width:100%; height:100%;"
| |
| |-
| |
| | style="text-align:center;" | [[BQP]]
| |
| |}
| |
| |
| |
| | colspan=2 |
| |
| {| cellpadding="0" cellspacing="0" border="1" style="background:lightGreen; width:100%; height:100%;"
| |
| |-
| |
| | style="text-align:center;" | [[NP (complexity)|NP]]
| |
| |}
| |
| |- style="text-align:center;"
| |
| | [[File:solidLine.png]]
| |
| | [[File:solidLine.png]]
| |
| | [[File:dottedLine.png]]
| |
| | [[File:dottedLine.png]]
| |
| |
| |
| | [[File:dottedLine.png]]
| |
| |- style="text-align:center;"
| |
| | [[File:solidLine.png]]
| |
| | [[File:solidLine.png]]
| |
| | [[File:dottedLine.png]]
| |
| |
| |
| {| cellpadding="0" cellspacing="0" border="1" style="background:lightGreen; width:100%; height:100%;"
| |
| |-
| |
| | style="text-align:center;" | [[Bounded-error probabilistic polynomial|BPP]]
| |
| |}
| |
| | width=10 |
| |
| | [[File:dottedLine.png]]
| |
| |- style="text-align:center;"
| |
| | [[File:solidLine.png]]
| |
| | [[File:solidLine.png]]
| |
| | [[File:dottedLine.png]]
| |
| | [[File:dottedLine.png]]
| |
| |
| |
| | [[File:dottedLine.png]]
| |
| |- style="text-align:center;"
| |
| | [[File:solidLine.png]]
| |
| | [[File:solidLine.png]]
| |
| | colspan=5 |
| |
| {| cellpadding="0" cellspacing="0" border="1" style="background:lightGreen; width:100%; height:100%;"
| |
| |-
| |
| | style="text-align:center;" | [[P (complexity)|P]]
| |
| |}
| |
| |- style="text-align:center;"
| |
| | [[File:solidLine.png]]
| |
| | [[File:solidLine.png]]
| |
| | [[File:dottedLine.png]]
| |
| |- style="text-align:center;"
| |
| | [[File:solidLine.png]]
| |
| | colspan=2 |
| |
| {| cellpadding="0" cellspacing="0" border="1" style="background:lightGreen; width:100%; height:100%;"
| |
| |-
| |
| | style="text-align:center;" | [[NC (complexity)|NC]]
| |
| |}
| |
| |- style="text-align:center;"
| |
| | [[File:solidLine.png]]
| |
| | colspan=2 | [[File:solidLine.png]]
| |
| |- style="text-align:center;"
| |
| | colspan=3 |
| |
| {| cellpadding="0" cellspacing="0" border="1" style="background:lightBlue; width:100%; height:100%;"
| |
| |-
| |
| | style="text-align:center;" | [[context-free grammar|Type 2 (Context Free)]]
| |
| |}
| |
| |- style="text-align:center;"
| |
| | colspan=3 | [[File:solidLine.png]]
| |
| |- style="text-align:center;"
| |
| | colspan=3 |
| |
| {| cellpadding="0" cellspacing="0" border="1" style="background:lightBlue; width:100%; height:100%;"
| |
| |-
| |
| | style="text-align:center;" | [[regular grammar|Type 3 (Regular)]]
| |
| |}
| |
| |}
| |
| | |
| ===Hierarchy theorems===
| |
| {{main|time hierarchy theorem|space hierarchy theorem}}
| |
| For the complexity classes defined in this way, it is desirable to prove that relaxing the requirements on (say) computation time indeed defines a bigger set of problems. In particular, although DTIME(''n'') is contained in DTIME(''n''<sup>2</sup>), it would be interesting to know if the inclusion is strict. For time and space requirements, the answer to such questions is given by the time and space hierarchy theorems respectively. They are called hierarchy theorems because they induce a proper hierarchy on the classes defined by constraining the respective resources. Thus there are pairs of complexity classes such that one is properly included in the other. Having deduced such proper set inclusions, we can proceed to make quantitative statements about how much more additional time or space is needed in order to increase the number of problems that can be solved.
| |
| | |
| More precisely, the [[time hierarchy theorem]] states that
| |
| :<math>\operatorname{DTIME}\big(f(n) \big) \subsetneq \operatorname{DTIME} \big(f(n) \sdot \log^{2}(f(n)) \big)</math>.
| |
| | |
| The [[space hierarchy theorem]] states that
| |
| :<math>\operatorname{DSPACE}\big(f(n)\big) \subsetneq \operatorname{DSPACE} \big(f(n) \sdot \log(f(n)) \big)</math>.
| |
| | |
| The time and space hierarchy theorems form the basis for most separation results of complexity classes. For instance, the time hierarchy theorem tells us that P is strictly contained in EXPTIME, and the space hierarchy theorem tells us that L is strictly contained in PSPACE.
| |
| | |
| ==See also==
| |
| * [[List of complexity classes]]
| |
| | |
| ==References==
| |
| <references/>
| |
| | |
| ==Further reading==
| |
| *[https://complexityzoo.uwaterloo.ca/Complexity_Zoo The Complexity Zoo]: A huge list of complexity classes, a reference for experts.
| |
| *[http://www.cs.umass.edu/~immerman/complexity_theory.html Diagram] by [[Neil Immerman]] showing the hierarchy of complexity classes and how they fit together.
| |
| *[[Michael Garey]], and [[David S. Johnson]]: ''Computers and Intractability: A Guide to the Theory of NP-Completeness.'' New York: W. H. Freeman & Co., 1979. The standard reference on NP-Complete problems - an important category of problems whose solutions appear to require an impractically long time to compute.
| |
| | |
| {{ComplexityClasses}}
| |
| | |
| [[Category:Complexity classes| ]]
| |
| [[Category:Computational complexity theory|*]]
| |
| [[Category:Measures of complexity]]
| |