Representing reductions of NP-complete problems in logical frameworks: a case study

Abstract

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 library for NP-complete problems, we describe a case study involving two well-known 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

Extracted Key Phrases

11 Figures and Tables

Cite this paper

@inproceedings{Schrmann2003RepresentingRO, title={Representing reductions of NP-complete problems in logical frameworks: a case study}, author={Carsten Sch{\"{u}rmann and Jatin Shah}, booktitle={MERLIN}, year={2003} }