According to Wikipedia, while the 2SAT problem is polynomial, its maximization variant MAX2SAT is NP-hard. But, they do not provide a reference for this claim. Is this obvious? If not, where can I find the reduction used to prove this claim?
Asked
Active
Viewed 32 times
1
-
1Try formulating independent set problem as a max 2SAT problem. – xskxzr Nov 21 '18 at 12:20
-
Thanks! I found the original proof here: https://www.sciencedirect.com/science/article/pii/0304397576900591 in pages 4-6. – Erel Segal-Halevi Nov 21 '18 at 13:10