Lax Lean Archive

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

Proof of `1|r_j|L_max is para-NP-hard for the largest and the number of processing times` (5th statement)

groundedproofs/Lax434175Proofs/SanityParams.lean · lax-434175

What this proof establishes

thm✓Lax434175.SanityParams (5th 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

The number of distinct processing times is at most pmax+1p_max + 1 (DominationDomination).