Skip to content
  1. CLRS-Lean
  2. Chapter 34. NP-Completeness
  3. 34.4. NP-Completeness Proofs
  4. 34.4. General CLIQUE — GeneralClique
Browse chapters
Imports
import CLRSLean.Chapter_34.Section_34_4_NP_Completeness_Proofs.GeneralClique.Completeness

Honest general CLIQUE

This facade exposes the graph-plus-k language, exact certificate semantics, the fixed polynomial-time certificate-checking machine, NP membership, and the concrete polynomial-time 3-CNF-SAT reduction.