Proof of `Clique inapproximability under NP not contained in BPP` (2nd statement)
groundedproofs/Lax323828Proofs/ComplexityConsequences.lean · lax-323828
What this proof establishes
Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.
Description
Contrapose the BPP consequence; the imported classes have the same binary language type, so no change of input encoding is involved.