The Complexity Of The NP-Class - Carlos Barron-Romero (CoRR, 2010)

Complete description of the static level sets for the system of two particles under a Van der Waals potential. - Carlos Barrón-Romero; Arutro Cueto-Hernández; Felipe Monroy-Pérez (CCE, 2011)

The Complexity of Euclidian 2 Dimension Travelling Salesman Problem versus General Assign Problem, NP is not P - Carlos Barron-Romero (CoRR, 2011)

Classical and Quantum Algorithms for the Boolean Satisfiability Problem. - Carlos Barron-Romero (CoRR, 2015)

Lower bound for the Complexity of the Boolean Satisfiability Problem. - Carlos Barron-Romero (CoRR, 2016)

A novel algorithm for solving the Decision Boolean Satisfiability Problem without algebra. - Carlos Barrón-Romero (CoRR, 2016)

Complexity and Stop Conditions for NP as General Assignment Problems, the Travel Salesman Problem in R2, Knight Tour Problem and Boolean Satisfiability Problem. - Carlos Barrón-Romero (CoRR, 2016)

Discrete Optimal Global Convergence of an Evolutionary Algorithm for Clusters under the Potential of Lennard Jones. - Carlos Barrón-Romero (CoRR, 2017)

The fast parallel algorithm for CNF SAT without algebra. - Carlos Barrón-Romero (CoRR, 2017)

On the controllability of a Cubic Semi-Linear Wave Equation. - Carlos Barrón-Romero (CoDIT, 2019)

The oLJ13 N13IC cluster is the global minimum cluster of Lennard Jones' potential for 13 particles. - Carlos Barron-Romero (ICECOCS, 2022)