Comment on The 2-MAXSAT Problem Can Be Solved in Polynomial TimeparentComments−CaptainNegative3yOnly 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.
Comments
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.