Proof of `Hitting Set Is NP-Hard` (3rd statement)
groundedproofs/Lax496464Proofs/HittingSet/Hardness.lean · lax-496464
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.
In the paper
- page 9 of this submission's paper
Description
The same reduction, writing the instance: the size clauses are those of the construction, composed with the polynomial length of the output of Cook's reduction.