Skip to content

Comment on The 2-MAXSAT Problem Can Be Solved in Polynomial Timeparent

Comments

Honestly, I don't think you have the proof. Proving p is euqal to np will have very big consequences, not only in computer science but also in logics for example. I think this problem is far more complex than you think and it is not going to be solved by chance by an amateur. If it's going to be solved, there will be a deep math argument.

AboutSource Built by g1lg1l

Hackerly is an independent reader for Hacker News, built on the public HN API. Not affiliated with Y Combinator.