Computational complexity theory
Algorithmic incentives
April 25, 2012
A new twist on pioneering work done by MIT cryptographers almost 30 years ago could lead to better ways of structuring contracts.
3 questions: P vs. NP
August 17, 2010
After glancing over a 100-page proof that claimed to solve the biggest problem in computer science, Scott Aaronson bet his house that it was wrong. Why?
What computer science can teach economics
November 8, 2009
Constantinos Daskalakis applies the theory of computational complexity to game theory, with consequences in a range of disciplines.
Explained: P vs. NP
October 29, 2009
The most notorious problem in theoretical computer science remains open, but the attempts to solve it have led to profound insights.
Subscribe
