Re:The 2-Maxsat Problem Can Be Solved in Polynomial Time
by CaptainNegative on Thursday April 27, 2023 @11:06AM
(#35729269)
Only if they're (i) conjectured hard instances (ii) for which we can verify that a given solution is indeed optimal. Which in many cases is itself is a Gödel prize worthy task.
[ Parent
| on HN ]
There are no comments on this comment yet.