◍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.CCShow all

3 papers · 1 filter

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…

cs.CC2015★ 3 cited

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…

cs.CC2010★ 4 cited

The Complexity Of The NP-Class

Carlos Barron-Romero

This paper presents a novel and straight formulation, and gives a complete insight towards the understanding of the complexity of the problems of the so called NP-Class. In particu…

◍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.