◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Kilian Risse

9 papers hereh-index 436 citations12 works total

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

author position
  • middle author2
  • last author7

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

fields
  • cs.CC8
  • cs.GT1

identity via Semantic Scholar / OpenAlex

activity
20192026
most citedPerfect Matching in Random Graphs is as Hard as Tseitin

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

collaborators
Showing 2025 · cs.CCShow all

1 paper · 2 filters

cs.CC2025

Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz

Jonas Conneryd, Susanna F. de Rezende, Jakob Nordström +2

We prove that polynomial calculus (and hence also Nullstellensatz) over any field requires linear degree to refute that sparse random regular graphs, as well as sparse Erdős-Rényi…

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