Travelling Salesman (2012 film)
http://dbpedia.org/resource/Travelling_Salesman_(2012_film) an entity of type: Thing
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.
rdf:langString
rdf:langString
Travelling Salesman (2012 film)
rdf:langString
Travelling Salesman
rdf:langString
Travelling Salesman
xsd:integer
35625846
xsd:integer
1112994011
rdf:langString
Benji Bakshi
rdf:langString
United States
rdf:langString
Timothy Lanzone
rdf:langString
Christopher McGlynn
rdf:langString
English
rdf:langString
Benjamin Krause
rdf:langString
Preston Clay Reed
rdf:langString
Andrew Lanzone
rdf:langString
Timothy Lanzone
rdf:langString
Steve West
rdf:langString
Eric Bloom
rdf:langString
Danny Barclay
rdf:langString
Matt Lagan
rdf:langString
David John Cole
rdf:langString
Malek Houlihan
rdf:langString
Marc Raymond
rdf:langString
Tyler Seiple
rdf:langString
Fretboard Pictures
rdf:langString
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. The story was written and directed by and premiered at the International House in Philadelphia on June 16, 2012. After screenings in eight countries, spanning four continents, including screenings at the University of Pennsylvania and the University of Cambridge, the film was released globally on September 10, 2013.
xsd:nonNegativeInteger
7211