In 2009 Doron has published a paper stating Using 3000 hours of CPU time on a CRAY machine, we settle the notorious P vs. NP problem in the affirmative, by presenting a polynomial time algorithm for the NP-complete subset sum problem.. I've been looking for other people's opinions on this but I haven't found anything significant. Has this problem been officially settled? is this a correct solution? I am not able to assess the paper because of my limited knowledge. What do you guys think ?Paper : http://www.math.rutgers.edu/~zeilberg/mamarim/mamarimPDF/pnp.pdf
Doron ZEILBERGER's P = NP computer proof
complexity theory;np complete
That paper is a hoax. If you look, it just throws numbers around for a huge polynomial bound, purports to solve a problem by Laurent polynomials without any clue on how they relate to the problem, shifts to integrals and estimates them by numerical means sufficiently precisely (and that is supposed to give the huge degree polynomial somehow). And nowhere are the 3000 hours of CRAY time to be seen.