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

Proof of `P | M_j | Σ w_j Z_j is strongly W[1]-hard for the number of machines`

groundedproofs/Lax434175Proofs/IsemStrong.lean · lax-434175

What this proof establishes

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

Construction 1 of lax-888481, padding, the threshold lowered to the total weight plus one, and the standard word: Multicoloured Clique fpt-reduces to the words whose numbers are at most 231(ℓ+1)312^31 (ℓ + 1)^31.