Skip to content
  1. CLRS-Lean
  2. Chapter 34. NP-Completeness
  3. 34.5. NP-Complete Problems
  4. 34.5. Decision traveling-salesperson problem
  5. 34.5. HAM-CYCLE to TSP reduction machine
  6. 34.5. Header Fields
  7. 34.5. Runtime
Browse chapters
Imports
import CLRSLean.Chapter_34.Section_34_5_NP_Complete_Problems.TravelingSalesperson.ReductionMachine.HeaderFields.Basic

Fixed polynomial-time TSP header formatters

noncomputable sectionnamespace CLRS.Chapter34.Turing.TSPReduction.HeaderFieldsopen PolyBuildernoncomputable def firstComputableInPolyTime : _root_.Turing.TM2ComputableInPolyTime id id first := statefulFlatMap_computableInPolyTime firstSpecnoncomputable def secondComputableInPolyTime : _root_.Turing.TM2ComputableInPolyTime id id second := statefulFlatMap_computableInPolyTime secondSpecend CLRS.Chapter34.Turing.TSPReduction.HeaderFields