ZPP is contained in BPP
Lax666725.ZPPSubsetBPP · concepts/Lax666725/ZPPSubsetBPP.lean · lax-666725
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
Zero-error polynomial time is contained in bounded-error polynomial time: . The proof combines the inclusion of ZPP in RP with the inclusion of the one-sided-error classes in BPP.
Concept map
Evidence
Each proof establishes this claim relative to its assumptions.
Lean source view on GitHub
| 1 | import Lax666725.RandomizedPolynomialTime |
| 2 | import Lax666725.ZeroError |
| 3 | |
| 4 | /-! |
| 5 | --- |
| 6 | title: ZPP is contained in BPP |
| 7 | type: theorem |
| 8 | --- |
| 9 | Zero-error polynomial time is contained in bounded-error polynomial time: |
| 10 | . |
| 11 | The proof combines the inclusion of ZPP in RP with the inclusion of the |
| 12 | one-sided-error classes in BPP. |
| 13 | -/ |
| 14 | |
| 15 | namespace Lax666725.ZPPSubsetBPP |
| 16 | |
| 17 | open RandomizedPolynomialTime ZeroError |
| 18 | |
| 19 | axiom ZPP_subset_BPP : ZPP ⊆ BPP |
| 20 | |
| 21 | end Lax666725.ZPPSubsetBPP |
| 22 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments