Skip to content

Comment on “P = NP” Polynomial-Sized LP Models for Hard Copsparent

Comments

You can solve the integer case via branch and bound: solving the relaxed linear problem and then in a tree search constraining integer variables to be 0/1. Potentially they're doing something equivalent to that?

But this leads to an exponential time algorithm.

If the claim were true that the solution is always integer, then one could use a poly-time LP solver.

AboutSource Built by g1lg1l

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