Scott Aaronson on P ?= NP

As of course is the way with these things, no sooner had I put online TYL2017 than something appears which I would like to add to the Guide. Scott Aaronson has put together a 120 pages survey article on the state-of-play on the question P ?= NP, written with his customary zip and clarity. This would make a very nice addition to the reading in my §6.3.2 on Computational Complexity. It may be for enthusiasts, but you don’t have to follow every detail to get something of the big picture.

There’s a little about the background to the piece and some responses to comments on Aaronson’s blog here.

This entry was posted in This and that. Bookmark the permalink.

Leave a Reply

Your email address will not be published. Required fields are marked *