4 citations · 10 across the 8 of their papers we have counts for
Showing 2016Show all
3 papers · 1 filter
cs.DS2016
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…
cs.DS2016
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…
cs.CC2016★ 1 cited
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…