Solving 2-MAXSAT in Polynomial Time: a Proof of $\textit{P}$ = $\textit{NP}$ · HackerPapers discussions

Solving 2-MAXSAT in Polynomial Time: a Proof of $\textit{P}$ = $\textit{NP}$ — mentioned by dvdkhlng

Thu, 27 Apr 2023 15:16:26 GMT

I already have problems following Proposition 1 where they introduce a different DNF with twice the clauses of the original CNF than claim that maximizing the satisfied clauses in the DNF would also yield a maximum satisfied solution for the CNF. It's a pitty they don't release any source code that we can unit-test against problems with known solutions (while also profiling run-time to stay within polynomial bounds) :) edit: what am I missing, their reduction to a DNF seems unsuitable to me? I read proposition 1 [1] to mean: they find an optimal solution for the DNF V∪X, then expect the…

Paper and discussion history. A mention is not an endorsement.

Solving 2-MAXSAT in Polynomial Time: a Proof of $\textit{P}$ = $\textit{NP}$ — HN submission

Thu, 27 Apr 2023 12:11:24 GMT

The 2-MAXSAT Problem Can Be Solved in Polynomial Time

61 points; 102 discussion replies on HN. Paper and source history. A submission is not an endorsement.

Solving 2-MAXSAT in Polynomial Time: a Proof of $\textit{P}$ = $\textit{NP}$ — HN submission

Wed, 26 Apr 2023 12:01:40 GMT

The 2-Maxsat Problem Can Be Solved in Polynomial Time

6 points; 5 discussion replies on HN. Paper and source history. A submission is not an endorsement.