最后的作业：STINGY SAT问题

8.3 STINGY SAT 问题

  In order to prove that STINGY SAT is an NP-complete problem,we firstly prove that (1)STINGY SAT is an NP problem and then (2) SAT problem 归约于 STINGY SAT.

PROVE(1):

    STINGY SAT is a special case of SAT problems , with a no more than k variables.So every solution to STINGY SAT is within a polynomial running time.

PROVE(2):

    SAT problem 归约于 STINGY SAT

    If we consider k as an input,then SAT can be reduced to STINGY SAT.

Hence, STINGY SAT is an NP-complete problem.