utopcell on The 2-MAXSAT Problem Can Be Solved in Polynomial Time · Hackerly

Skip to content

Top New Best Ask Show Jobs

Top New Best Ask Show Jobs

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

Comments

Of course.

AboutSource Built by g1lg1l

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