Carlos Barron-Romero

According to our database, Carlos Barron-Romero authored at least 11 papers between 2010 and 2022.

Collaborative distances:

• Dijkstra number of seven.
• Erdős number of six.

2022

The oLJ13 N13IC cluster is the global minimum cluster of Lennard Jones' potential for 13 particles.

Carlos Barron-Romero

Proceedings of the 3rd IEEE International Conference on Electronics, 2022

2019

On the controllability of a Cubic Semi-Linear Wave Equation.

Carlos Barrón-Romero

Proceedings of the 6th International Conference on Control, 2019

2017

The fast parallel algorithm for CNF SAT without algebra.

Carlos Barrón-Romero

CoRR, 2017

Discrete Optimal Global Convergence of an Evolutionary Algorithm for Clusters under the Potential of Lennard Jones.

Carlos Barrón-Romero

CoRR, 2017

2016

Complexity and Stop Conditions for NP as General Assignment Problems, the Travel Salesman Problem in R², Knight Tour Problem and Boolean Satisfiability Problem.

Carlos Barrón-Romero

CoRR, 2016

A novel algorithm for solving the Decision Boolean Satisfiability Problem without algebra.

Carlos Barrón-Romero

CoRR, 2016

Lower bound for the Complexity of the Boolean Satisfiability Problem.

Carlos Barron-Romero

CoRR, 2016

2015

Classical and Quantum Algorithms for the Boolean Satisfiability Problem.

Carlos Barron-Romero

CoRR, 2015

2011

The Complexity of Euclidian 2 Dimension Travelling Salesman Problem versus General Assign Problem, NP is not P

Carlos Barron-Romero

CoRR, 2011

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

Proceedings of the 8th International Conference on Electrical Engineering, 2011

2010

The Complexity Of The NP-Class

Carlos Barron-Romero

CoRR, 2010