Get the latest tech news
P vs. NP and the Difficulty of Computation: A ruliological approach
A new look at what can be discovered about questions of computational complexity theory that have arisen in theoretical computer science--including the P vs. NP question.
None
Or read this on Hacker News