Comment on The 2-MAXSAT Problem Can Be Solved in Polynomial TimeparentComments−klyrs3yAlgorithms which are obviously polynomial, and non-obviously correct are the only ones I'd entertain from a novice. It's not hard to mine for counterexamples, as long as the code runs.
Comments
Algorithms which are obviously polynomial, and non-obviously correct are the only ones I'd entertain from a novice. It's not hard to mine for counterexamples, as long as the code runs.