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. NPCompleteness
Browse chapters
Imports
import CLRSLean.Chapter_34.Section_34_5_NP_Complete_Problems.TravelingSalesperson.NP import CLRSLean.Chapter_34.Section_34_5_NP_Complete_Problems.TravelingSalesperson.Hardness

General decision-TSP is NP-complete

namespace CLRS.Chapter34

The honest serialized decision-TSP language is NP-complete.

theorem TSP_npComplete : NPComplete TSP := ⟨generalTSP_polyTimeVerifiable, TSP_npHard⟩
end CLRS.Chapter34