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

groundedproofs/Lax434175Proofs/SanityParams.lean · lax-434175

What this proof establishes

thm✓Lax391470.Theorem1
thm✓Lax434175.Propagation
thm✓Lax496464.WH_A4_MachineFacts
thm✓Lax496464.WH_A5_Bridges
thm✓Lax759944.TuringRamPolytimeEquivalence

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