Lax Lean Archive

While this submission is a draft, it cannot be used by other submissions.

Proof of `Scheduling with two non-unit job lengths is NP-complete` (3rd statement)

groundedproofs/Lax391470Proofs/Hardness.lean · lax-391470

What this proof establishes

thm✓Lax391470.Theorem1 (3rd statement)

Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.

Read the Lean proof on GitHub

Description

Compose Lemma 2's hardness with the reduction of Lemma 1.