BPP is contained in PP
Lax666725.BPPSubsetPP · concepts/Lax666725/BPPSubsetPP.lean · lax-666725
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
Bounded-error polynomial time is contained in unbounded-error polynomial time: . The same procedure witnesses the inclusion, since .
Concept map
Lean source view on GitHub
| 1 | import Lax666725.RandomizedPolynomialTime |
| 2 | import Lax666725.UnboundedError |
| 3 | |
| 4 | /-! |
| 5 | --- |
| 6 | title: BPP is contained in PP |
| 7 | type: theorem |
| 8 | --- |
| 9 | Bounded-error polynomial time is contained in unbounded-error polynomial |
| 10 | time: . |
| 11 | The same procedure witnesses the inclusion, since . |
| 12 | -/ |
| 13 | |
| 14 | namespace Lax666725.BPPSubsetPP |
| 15 | |
| 16 | open RandomizedPolynomialTime UnboundedError |
| 17 | |
| 18 | axiom BPP_subset_PP : BPP ⊆ PP |
| 19 | |
| 20 | end Lax666725.BPPSubsetPP |
| 21 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments