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
Browse chapters
Imports
import CLRSLean.Chapter_34.Section_34_4_NP_Completeness_Proofs.GeneralCircuit.ToSAT.Machine.GuardedBridge

General CIRCUIT-SAT to SAT machine

Facade exporting the concrete fixed TM2, its guarded intermediate semantics, and polynomial-time computation of generalCircuitToSATMap.