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 `Polynomial size and approximation gap after sampling` (3rd statement)

groundedproofs/Lax253009Proofs/SamplingParameters.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 rounded binary logarithm loses at most a factor two. Raising its exponential to the fixed power (t+f)c gives an explicit polynomial bound.