AllMovie

Travelling Salesman is a 2012 intellectual thriller film about four mathematicians who solve the P versus NP problem, one of the most challenging mathematical problems in history. The title refers to the travelling salesman problem, an optimization problem that acts like a key to solving other difficult mathematical problems. It has been proven that a quick travelling salesman algorithm, if one exists, could be converted into quick algorithms for many other difficult tasks, such as factoring large numbers. Since many cryptographic schemes rely on the difficulty of factoring integers to protect their data, a quick solution would enable access to encrypted private data like personal correspondence, bank accounts and, possibly, government secrets.