Proof of `Open questions of The Scheduling Zoo`
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.
Description
Every problem of W[t] reduces to the parameterized problem, which is in FPT.