Lectures on the Philosophy of Mathematics

by Joel David Hamkins

The question asks, in other words, whether any of the NP complete problems mentioned here have polynomial-time solutions. This is the single most important open question in computer science.