[FOM] P =? NP: A practically important breakthrough

[Moshe Vardi]

Let me point out two pieces I have written on these issues:
"On P, NP, and Computational Complexity"
"Boolean Satisfiability: Theory and Engineering"
at: http://cacm.acm.org/about-communications/editors-letters/

Moshe
P.S. See also: "Solving the Unsolvable"
P.P.S. Regarding "oracle results", see
https://rjlipton.wordpress.com/2009/05/21/i-hate-oracle-results/