P==NP

I spent too much of my misspent youth looking into optimization techniques and scheduling problems and I would always come up against computationally intractable solutions and then looking for a more practical solution. I think that these experiences have made me the pragmatist I am today (best effort is better than not achieving perfection).

Doron Zeilberger has published a proof that P=NP, you can read his paper here. While on paper this could revolutionise computing and specific areas of optimization, the author has expressed that the solution presented is certainly not practical for the foreseeable future.

b.

references

Cook, Stephen (1971). "The complexity of theorem proving procedures"   Proceedings of the Third Annual ACM Symposium on Theory of Computing. pp. 151–158.
Garey, Michael R.; David S. Johnson (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman. ISBN 0716710455.