Re:The 2-Maxsat Problem Can Be Solved in Polynomial Time
by e79 on Thursday April 27, 2023 @11:56AM
(#35729983)
The contest approach wouldn’t necessarily hold rigor, because it doesn’t formally prove that all 2-MAXSAT problems can be solved using this algorithm. Just that one or more cherry-picked problems can. I think the paper really just needs to present actual proofs for the propositions it makes (as others have pointed out).
[ Parent
| on HN ]
There are no comments on this comment yet.