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

Carsten Schürmann Jatin Shah

Published in: MERLIN (2003)

Keyphrases

np complete problems
np complete
graph coloring
phase transition
sat problem
hard problems
lower bound
upper bound
satisfiability problem