Facts
Citation
URLhttps://en.wikipedia.org/wiki/Sipser%E2%80%93Lautemann_theorem
Sources
Sipser-Lautemann theorem, Wikipedia
Lead sectionQuote, Lead section
In computational complexity theory, the Sipser-Lautemann theorem or Sipser-Gács-Lautemann theorem states that bounded-error probabilistic polynomial (BPP) time is contained in the polynomial time hierarchy, and more specifically Σ2 ∩ Π2.
Claims Backed By This Source (8 claims)
This source backs 8 claims across the atlas. As facts: 4 well-attested. As cited relationships: 2 holds. Plus 2 entities citing it as a general reference with no single fact or relationship attached.
Disposition By Topic
- Theorems, 7 claims: 3 well-attested, 2 holds, 2 general references.
- Sources, 1 claims: 1 well-attested.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.