> So it appears that they're finding approximate solutions, so already it's rather less significant than the title suggests The title doesn't suggest anything

> So it appears that they're finding approximate solutions, so already it's rather less significant than the title suggests The title doesn't suggest anything about exact solutions as far as I can tell. > We know that for most NP-Complete problems, most instances are easy. The question then is whether they are testing their algorithms on instances that are known to be hard. There's a chance they're doing something like finding factors of random integers, which we know is easy in almost every instance. I don't know how they choose the problems they choose to solve but I assume this information is in the paper? If you are skeptical then why not read it and report your findings? Simply expressing your skepticism doesn't seem valuable.