◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Biman Roy

1 paper hereh-index 537 citations11 works total

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

author position
  • last author1

Across the 1 of 1 paper where every author was matched, so the position is known.

fields
  • cs.CC1

identity via Semantic Scholar / OpenAlex

most citedTime Complexity of Constraint Satisfaction via Universal Algebra

5 citations · 5 across the 1 of their papers we have counts for

collaborators

1 paper

cs.CC2017★ 5 cited

Time Complexity of Constraint Satisfaction via Universal Algebra

Peter Jonsson, Victor Lagerkvist, Biman Roy

The exponential-time hypothesis (ETH) states that 3-SAT is not solvable in subexponential time, i.e. not solvable in O(c^n) time for arbitrary c > 1, where n denotes the number of…

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