1. CLRS-Lean
  2. Chapter 34. NP-Completeness
  3. 34.4. NP-Completeness Proofs
  4. 34.4. Cook--Levin infrastructure
  5. 34.4. Verifier circuitization
  6. 34.4. Whole-tableau constraint families
  7. 34.4. Tableau constraint families
Imports
import CLRSLean.Chapter_34.Section_34_4_NP_Completeness_Proofs.CookLevin.Circuitization.TableauConstraints.ValidityFamily import CLRSLean.Chapter_34.Section_34_4_NP_Completeness_Proofs.CookLevin.Circuitization.TableauConstraints.TransitionFamily

Cook--Levin whole-tableau constraint families

Stable facade for the proof-carrying serial validity and adjacent-transition families. Input shape, boundary constraints, and the final conjunction remain separate circuitization layers.