Skip to content
  1. CLRS-Lean
  2. Chapter 34. NP-Completeness
  3. 34.5. NP-Complete Problems
  4. 34.5. HAM-CYCLE
  5. 34.5. HAM-CYCLE fixed verifier machinery
  6. 34.5. HAM-CYCLE cycle-adjacency verifier
Browse chapters
Imports
import CLRSLean.Chapter_34.Section_34_5_NP_Complete_Problems.HamiltonianCycle.VerifierMachine.CycleAdjacency.Semantics

HAM-CYCLE cycle-adjacency verifier facade

Exports the total fixed polynomial-time pipeline from an arbitrary raw certificate/graph pair to the conjunction of all consecutive and closing edge-membership checks.