Earlier, my essay on the mathematical problem P vs NP was published on Paul’s blog.
A short memory refresher:
The P versus NP problem is a major unsolved problem in theoretical computer science. In informal terms, it asks whether every problem whose solution can be quickly verified can also be quickly solved.
In that essay, some samples of this question were mentioned, like The Traveling Salesman problem and also the subset sum problem. Continue reading →
