4 citations · 10 across the 8 of their papers we have counts for
4 papers · 1 filter
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…
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…