Proof of `Håstad's clique inapproximability theorem` (2nd statement)
groundedproofs/Lax323828Proofs/ComplexityConsequences.lean · lax-323828
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.
Description
Contraposition of the main clique-hardness implication. This proof retains that implication as an explicit archive assumption.