Proof of `0-1 integer programming` (3rd statement)
groundedproofs/Lax799700Proofs/Bridge/ZeroOneIP.lean · lax-799700
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
Membership from the library's existential second-order definition of ZeroOneIP; hardness from the library's reduction out of Knapsack, which is NP- hard by the catalog’s statement for it. Both are transported to the catalog's problems along the agreements.