◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

C. Barrón-Romero

8 papers hereh-index 224 citations11 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author8

Across the 8 of 8 papers where every author was matched, so the position is known.

fields
  • cs.DS4
  • cs.CC3
  • cs.CE1

identity via Semantic Scholar / OpenAlex

activity
20102017
most citedThe Complexity Of The NP-Class

4 citations · 10 across the 8 of their papers we have counts for

collaborators
Showing cs.DSShow all

4 papers · 1 filter

cs.DS2017★ 1 cited

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…

cs.DS2016

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

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.DS2010★ 1 cited

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…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.