◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Hannes Uppman

4 papers hereh-index 561 citations11 works total

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

author position
  • sole author2
  • middle author1
  • last author1

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

fields
  • cs.CC4

identity via Semantic Scholar / OpenAlex

activity
20132017
most citedThe complexity of Boolean surjective general-valued CSPs

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

collaborators
Showing 2014 · cs.CCShow all

1 paper · 2 filters

cs.CC2014

Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis

Peter Jonsson, Victor Lagerkvist, Johannes Schmidt +1

Obtaining lower bounds for NP-hard problems has for a long time been an active area of research. Recent algebraic techniques introduced by Jonsson et al. (SODA 2013) show that the…

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