|
|
| (One intermediate revision by one other user not shown) |
| Line 1: |
Line 1: |
| In [[computational complexity theory]], a [[complexity class]] ''B'' is said to be '''low''' for a complexity class ''A'' if ''A''<sup>''B''</sup> = ''A''; that is, ''A'' with an [[oracle machine|oracle]] for ''B'' is equal to ''A''. Such a statement implies that an [[abstract machine]] which solves problems in ''A'' achieves no additional power if it is given the ability to solve problems in ''B'' at unit cost. In particular, this means that if ''B'' is low for ''A'' then ''B'' is contained in ''A''. Informally, lowness means that problems in ''B'' are not only solvable by machines which can solve problems in ''A'', but are "easy to solve." An ''A'' machine can simulate many oracle queries to ''B'' without exceeding its resource bounds.
| | Neurologist Bud from Dunchurch, has numerous passions including four, property developers in [http://trindee.com/community/members/anglewarburto/activity/8987/ singapore hdb rental] and consuming out. Is enthused how huge the globe is after going to The Causses and the Cévennes. |
| | |
| Results and relationships that establish one class as low for another are often called '''lowness''' results.
| |
| | |
| == Results ==
| |
| | |
| Several natural complexity classes are known to be low for themselves. For instance, [[P (complexity)|P]] is low for itself (that is, P<sup>P</sup> = P) because polynomial-time algorithms are closed under composition: a polynomial-time algorithm can make polynomially many queries to other polynomial-time algorithms, while retaining a polynomial running time. [[PSPACE]] is also low for itself, and this can be established by exactly the same argument. Similarly, [[L (complexity)|L]] is low for itself because it can simulate log space oracle queries in log space, reusing the same space for each query.
| |
| | |
| [[Bounded-error probabilistic polynomial|BPP]] is also low for itself and the same arguments almost work for BPP, but one has to account for errors, making it slightly harder to show that BPP is low for itself. Similarly, the argument for BPP almost goes through for [[BQP]], but we have to additionally show that quantum queries can be performed in coherent superposition.<ref name=BernVazi>Bernstein and Vazirani, Quantum complexity theory, [[SIAM Journal on Computing]], 26(5):1411-1473, 1997. [http://www.cs.berkeley.edu/~vazirani/bv.ps]</ref>
| |
|
| |
| Every class which is low for itself is closed under [[complement (complexity)|complement]], provided that it is powerful enough to negate the boolean result. This implies that '''NP''' isn't low for itself unless '''NP''' = co-'''NP''', which is considered unlikely because it implies that the [[polynomial hierarchy]] collapses to the first level, whereas it is widely believed that the hierarchy is infinite. The converse to this statement is not true. If a class is closed under complement, it does not mean that the class is low for itself. An example of such a class is [[EXP]], which is closed under complement, but is not low for itself.
| |
| | |
| Some of the more complex and famous results regarding lowness of classes include:
| |
| * Both [[Parity P]] (<math>{\oplus}\hbox{P}</math>) and [[Bounded-error probabilistic polynomial|BPP]] are low for themselves. These were important in showing [[Toda's theorem]].<ref>[http://www.cs.rutgers.edu/~allender/538/murata3.pdf]</ref>
| |
| * [[BQP]] is low for [[PP (complexity)|PP]] <ref>L. Fortnow and J. D. Rogers. Complexity limitations on quantum computation. In ''Proceedings of IEEE Complexity '98'', p.202-209. 1998. {{arxiv|cs.CC/9811023}}. </ref> In other words, a program based around taking the majority decision of an unbounded number of iterations of a poly-time [[randomized algorithm]] can easily solve all the problems that a [[quantum computer]] can solve efficiently.
| |
| * The [[graph isomorphism problem]] is low for [[Parity P]] (<math>{\oplus}\hbox{P}</math>).<ref>V. Arvind and P. Kurur. Graph isomorphism is in SPP. {{ECCC|2002|02|037}}. 2002.</ref> This means that if we can determine whether an '''NP''' machine has an even or odd number of accepting paths, we can easily solve graph isomorphism. In fact, it was later shown that graph isomorphism is low for '''[[ZPP (complexity)|ZPP]]<sup>NP</sup>'''.<ref>Vikraman Arvind and Johannes Köbler. Graph Isomorphism Is Low for ZPP(NP) and Other Lowness Results. ''Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science'', ISBN 3-540-67141-2, p.431-442. 2000.</ref>
| |
| * [[Amplified PP]] is low for [[PP (complexity)|PP]].<ref>L. Li. On the Counting Functions. PhD thesis, University of Chicago. 1993.</ref>
| |
| | |
| == Applications ==
| |
| | |
| Lowness is particularly valuable in relativization arguments, where it can be used to establish that the power of a class does not change in the "relativized universe" where a particular oracle machine is available for free. This allows us to reason about it in the same manner we normally would. For example, in the relativized universe of '''BQP''', '''PP''' is still closed under union and intersection. It's also useful when seeking to expand the power of a machine with oracles, because lowness results determine when the machine's power remains the same.
| |
| | |
| ==See also==
| |
| * [[Low (computability)]]
| |
| | |
| == References ==
| |
| | |
| <references />
| |
| | |
| [[Category:Computational complexity theory]]
| |
Neurologist Bud from Dunchurch, has numerous passions including four, property developers in singapore hdb rental and consuming out. Is enthused how huge the globe is after going to The Causses and the Cévennes.