This question already has an answer here:

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?


marked as duplicate by Apass.Jack, Community Nov 21 '18 at 13:10

This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.