Travelling Salesman
The United States government hires four mathematicians to solve the hardest problem in computer science history.
The United States government hires four mathematicians to solve the hardest problem in computer science history.