Ruben Interian

2 Questions 8 Answers 0 Followers

Questions related from Ruben Interian

Which are the most important open problems in graph theory today?

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,860 0 View

It is possible that in the future, desktop applications disappear, and all projects and jobs will be done in the "cloud"?

Having operating systems in the cloud, with all personal files, and programming in the cloud.

07 July 2012 8,057 3 View