P vs. NP and the Computational Complexity Zoo

There's hard problems, and then there's really hard problems. But it's hard to pin down the difference between them.

If you like this article, please sign up for Snapshot, Portside's daily summary.

(One summary e-mail a day, you can change anytime, and Portside is always free.)