Skip to content
  1. CLRS-Lean
  2. Chapter 34. NP-Completeness
  3. 34.4. NP-Completeness Proofs
  4. 34.4. Standalone SAT Certificate Semantics
  5. 34.4. Reduction-Backed SAT Verifier
Browse chapters
Imports
import CLRSLean.Chapter_34.Section_34_4_NP_Completeness_Proofs.SAT.ReductionVerifier.Semantics

Reduction-backed SAT verifier

This implementation-facing facade groups the certificate codec, named SAT-to-3-CNF map, fixed composed machine, and exact bounded-certificate semantics used by the public SAT NP-completeness theorem.