4 citations · 10 across the 8 of their papers we have counts for
Showing 2010Show all
2 papers · 1 filter
cs.DS2010★ 1 cited
The Complexity of Euclidian 2 Dimension Travelling Salesman Problem versus General Assign Problem, NP is not P
Carlos Barron-Romero
This paper presents the differences between two NP problems. It focuses in the Euclidian 2 Dimension Travelling Salesman Problems and General Assign Problems. The main results are…
cs.CC2010★ 4 cited
The Complexity Of The NP-Class
Carlos Barron-Romero
This paper presents a novel and straight formulation, and gives a complete insight towards the understanding of the complexity of the problems of the so called NP-Class. In particu…