By the MAXSAT problem, we are given a set $V$ of $m$ variables and a collection $C$ of $n$ clauses over $V$. We will seek a truth assignment to maximize the number of satisfied clauses. This problem is $\textit{NP}$-hard even for its restricted version, the 2-MAXSAT problem by which every clause contains at most 2 literals. In this paper, we discuss a polynomial time algorithm to solve this problem. Its time complexity is bounded by O($n^2m^3$). Hence, we provide a proof of $P$ = $\textit{NP}$.

翻译：给定包含$m$个变量的集合$V$以及$V$上包含$n$个子句的集合$C$，我们寻求最大化可满足子句数量的真值赋值。即使在每个子句最多包含两个文字的限制版本2-MAXSAT问题中，该问题也是$\textit{NP}$-难的。本文讨论了一个求解该问题的多项式时间算法，其时间复杂度为O($n^2m^3$)，从而给出了$P$ = $\textit{NP}$的一个证明。