Skip to content
  1. CLRS-Lean
  2. Chapter 34. NP-Completeness
  3. 34.4. NP-Completeness Proofs
  4. 34.4. General Acyclic Boolean Circuits
  5. 34.4. General Circuit Satisfiability to SAT
  6. 34.4. General Circuit-to-SAT Reduction Machine
  7. 34.4. General Circuit Formula Emitter
Browse chapters
Imports
import CLRSLean.Chapter_34.Section_34_4_NP_Completeness_Proofs.GeneralCircuit.ToSAT.Machine.Emitter.Computable

General-circuit formula emitter

Public facade for the fixed TM2 that emits the canonical SAT formula from a guarded normalized circuit record, together with its polynomial runtime proof.