Proof of `Nice Tree Decompositions of Small Width Are Found in Fixed-Parameter Time`
What this proof establishes
no assumptions
Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.
In the paper
- page 2 of this submission's paper
Description
Bodlaender's theorem with Kloks' niceness on a word RAM, proved by running the exact Bodlaender–Kloks algorithm (the vertex-by-vertex wrapper around the dynamic program over characteristics) as a functional program on a verified virtual machine and compiling it.