Proof of `NP-Hardness of (3,4)-SAT`
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 4 of this submission's paper
Description
Satisfiability is NP-hard by the Cook–Levin theorem, the reduction is correct and runs in polynomial time, and polynomial-time many-one reductions compose.