Proof of `The Integer Programs of the Clients' Reduction Are Fixed-Parameter Tractable`
groundedproofs/Lax117284Proofs/Machine/IlpFinal.lean · lax-117284
What this proof establishes
no assumptions
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
The verified solver satisfies the archive's shared fixed-parameter time definition.