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 `Small-value projection games for every registered NP language`

groundedproofs/Lax253009Proofs/SmallValueNP.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

The explicit registered-machine simulation supplies Cook–Levin, and the fixed-alphabet soundness amplifier preserves a polynomial bound in input length.