Version history

Submission versions

  1. lax-323828current version

    Håstad’s inapproximability of Max Clique

  2. lax-253009viewing

    Håstad’s inapproximability of Max Clique

    GitHub sourceShown on this page

Proof of `Clique inapproximability under NP not contained in BPP` (2nd statement)

groundedproofs/Lax253009Proofs/ComplexityConsequences.lean · lax-253009

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.

Read the Lean proof on GitHub

Description

Contrapose the BPP consequence; the imported classes have the same binary language type, so no change of input encoding is involved.