Sipser-Lautemann theorem

From Complexity
Revision as of 00:43, 13 August 2010 by Vipul (talk | contribs) (Created page with "{{complexity class containment|smaller = BPP|larger = Sigma2P}} {{complexity class containment|smaller = BPP|larger = Pi2P}} {{complexity class containment|smaller = BPP|larger =...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

This article gives the statement, and proof, of one complexity class being contained in another one. The smaller complexity class is BPP and the larger complexity class is Sigma2P.

This article gives the statement, and proof, of one complexity class being contained in another one. The smaller complexity class is BPP and the larger complexity class is Pi2P.

This article gives the statement, and proof, of one complexity class being contained in another one. The smaller complexity class is BPP and the larger complexity class is Sigma2P intersect Pi2P.

Statement

Statement in terms of complexity classes

The theorem has the following equivalent forms:

  1. The complexity class BPP is contained in the class Σ2P (Sigma2P).
  2. The complexity class BPP is contained in the class Π2P (Pi2P).
  3. The complexity class BPP is contained in the class Σ2PΠ2P (Sigma2P intersect Pi2P).

Note that (1) and (2) are equivalent because BPP is self-complementary and Σ2 and Π2 are complements to each other. (3) implies both (1) and (2) and (1) and (2) together imply (3), so all statements are equivalent.