News for hackers. Stuff that matters.

A comment on Evidence of exponential speed-up in the solution of hard optimization problems?. Parent comment

Re:Evidence of exponential speed-up in the solution of hard ... by gabrielgoh on Wednesday December 27, 2017 @07:56PM (#16019451)
they did experiments on the 2016 Max-SAT challenge, which seems to me like a legitimate class of problem instances.
[ Parent | on HN ]
Re:Evidence of exponential speed-up in the solution of hard ... by nhaehnle on Thursday December 28, 2017 @04:54AM (#16021192)
Yes, and this does indeed mean that their results may be of practical importance.

At the same time, it's pretty well known that the kind of problem instances arising in practice and in those challenges are not hard instances. In other words, this also means that their result is extremely unlikely to be relevant for the P=?NP question.

[ Parent | on HN ]