Proof of `Independent Set Is W[1]-Complete` (1st statement)

groundedproofs/Lax496464Proofs/WHierarchy/Reductions/CliqueIS/Final.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 map (G,k)↦(Gc,k)(G, k) ↦ (Gᶜ, k), computed by one IMP+ program (read the word, build the adjacency matrix from the CSR blocks, write the CSR word of the complement with the blocks in increasing order, then kk) in time quadratic in the word, is a reduction with the parameter unchanged.