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's clique inapproximability theorem` (1st statement)

groundedproofs/Lax253009Proofs/CliqueHardness.lean · lax-253009

Description

The uniform PCP and clique reduction give a polynomial-time fair-tape test for every registered NP language. Rejection tapes certify its complement, so complementary tests combine into a zero-error finite-tape algorithm. The probability-preserving compiler implements it in the registered probabilistic machine model with a worst-case polynomial clock. The reverse inclusion is the proved registered containment ZPP ⊆ NP.