-
12th July 2017 21:52
Link to Post #1
Movie : TRAVELING SALESMAN (about the most powerful problem in computer science)
MOVIE : TRAVELING SALESMAN ... 2012 ... 1:20 MINS
http://putlockers-9.com/travelling-salesman/
Four mathematicians are hired by the US government to solve the most powerful problem in computer science history.
4 Mathematicians solve the problem P=NP ... P versus NP problem -
The P versus NP problem is a major unsolved problem in computer science. Informally speaking, it asks whether every problem whose solution can be quickly verified by a computer can also be quickly solved by a computer.
Govt has it's own idea what to do with it, and it begins .
-
The Following 6 Users Say Thank You to ramus For This Post:
DeDukshyn (12th July 2017), gaiagirl (15th July 2017), Lifebringer (14th July 2017), Mike (13th July 2017), Nasu (12th July 2017), Noelle (13th July 2017)
-
12th July 2017 22:32
Link to Post #2