4 citations · 10 across the 8 of their papers we have counts for
8 papers
Discrete Optimal Global Convergence of an Evolutionary Algorithm for Clusters under the Potential of Lennard Jones
Carlos Barrón-Romero
A review of the properties that bond the particles under Lennard Jones Potential allow to states properties and conditions for building evolutive algorithms using the CB lattice wi…
The fast parallel algorithm for CNF SAT without algebra
Carlos Barrón-Romero
A novel parallel algorithm for solving the classical Decision Boolean Satisfiability problem with clauses in conjunctive normal form is depicted. My approach for solving SAT is wit…
Complexity and Stop Conditions for NP as General Assignment Problems, the Travel Salesman Problem in , Knight Tour Problem and Boolean Satisfiability Problem
Carlos Barrón-Romero
This paper presents stop conditions for solving General Assignment Problems (GAP), in particular for Travel Salesman Problem in an Euclidian 2D space the well known condition Jorda…
A novel algorithm for solving the Decision Boolean Satisfiability Problem without algebra
Carlos Barrón-Romero
This paper depicts an algorithm for solving the Decision Boolean Satisfiability Problem using the binary numerical properties of a Special Decision Satisfiability Problem, parallel…
Lower bound for the Complexity of the Boolean Satisfiability Problem
Carlos Barrón-Romero
This paper depicts algorithms for solving the decision Boolean Satisfiability Problem. An extreme problem is formulated to analyze the complexity of algorithms and the complexity f…
Classical and Quantum Algorithms for the Boolean Satisfiability Problem
Carlos Barrón-Romero
This paper presents a complete algorithmic study of the decision Boolean Satisfiability Problem under the classical computation and quantum computation theories. The paper depicts…