Representing reductions of NP-complete problems in logical frameworks

Carsten Schürmann, Jatin Shah
2003 Proceedings of the 2003 workshop on Mechanized reasoning about languages with variable binding - MERLIN '03  
Under the widely believed conjecture P =NP, NP-complete problems cannot be solved exactly using efficient polynomial time algorithms. Furthermore, any instance of a NP-complete problem can be converted to an instance of another problem in NP in polynomial time. Thus, identifying NP-complete problems is very important in algorithm design and can help computer scientists and engineers redirect their efforts towards finding approximate solutions to these problems. As a first step towards a digital
more » ... library for NP-complete problems, we describe a case study involving two wellknown NP-complete problems 3-SAT and CHROMATIC together with a reduction and the corresponding soundness proof in a logical framework.
doi:10.1145/976571.976579 dblp:conf/icfp/SchurmannS03 fatcat:4rp7izbzjzd33n2y4gdvujnrni