2 Questions 8 Answers 0 Followers
Questions related from Ruben Interian
In particular, those whose NP-completeness or NP-hardness is not been proven. Problems, having the hope to be solved in polynomial time, that can contribute to the development of the graph theory.
09 September 2015 5,878 0 View
Having operating systems in the cloud, with all personal files, and programming in the cloud.
07 July 2012 8,067 3 View