Travelling Salesman

Travelling Salesman

Four mathematicians are hired by the US government to solve the most powerful problem in computer science history.
4.6 of 10 (32 voted) 10 32