The Almost-SAT problem takes as input a boolean formula on n…
The Almost-SAT problem takes as input a boolean formula on n literals and m clauses, in conjunctive normal form. The output is an assignment of the literals such that exactly m−1 clauses evaluates to TRUE, if such assignment exists, and outputs NO otherwise. Shows that Almost-SAT is NP complete.
Read Details