Proof of `FF(1,m)||ΣZj is strongly W[2]-hard for the number of machines` (1st statement)

groundedproofs/Lax434175Proofs/JitW2.lean · lax-434175

What this proof establishes

thm✓Lax434175.Propagation
thm✓Lax496464.Theorem1
thm✓Lax496464.WH_A3_ReductionCalculus
thm✓Lax496464.WH_A4_MachineFacts
thm✓Lax496464.WH_A5_Bridges
thm✓Lax496464.WH_E3_DominatingSet
thm✓Lax759944.TuringRamPolytimeEquivalence

thm✓Lax434175.JitFlowShopW2 (1st 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 same reduction lands in the words whose numbers are at most $64 (|w| + 1)^4$ .