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 `Håstad inapproximability for bounded-error randomized algorithms` (2nd statement)

groundedproofs/Lax253009Proofs/RandomizedCliqueHardness.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 randomized implication through its concept statement so the archive records the dependency in the proof network.