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

Authors:
Carsten Schürmann;Jatin Shah
Affiliations:
Yale University, New Haven, CT;Yale University, New Haven, CT
Venue:
MERLIN '03 Proceedings of the 2003 ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding
Year:
2003

Citing 6
Cited 2

Linear logic

Theoretical Computer Science
A framework for defining logics

Journal of the ACM (JACM)
A new recursion-theoretic characterization of the polytime functions

Computational Complexity
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A Linear Logical Framework

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Linear Types and Non Size-Increasing Polynomial Time Computation

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science

A formalization of polytime functions

ITP'11 Proceedings of the Second international conference on Interactive theorem proving
Identifying polynomial-time recursive functions

CSL'05 Proceedings of the 19th international conference on Computer Science Logic

Quantified Score

Hi-index	0.00

Visualization

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.