Proof of `Hitting Set Is in W[2]` (1st statement)

groundedproofs/Lax496464Proofs/WHierarchy/HittingSet/Param.lean · lax-496464

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

The parameter of a Hitting Set word is computed in polynomial time by the IMP+ program that reads the word — the codes of nn, mm and kk, then the sets — and writes kk: at most 20000(∣x∣+1)320000 (|x| + 1)^3 steps, with values below 2(∣x∣+7)2 ^ (|x| + 7).