Scholar
Kilian Risse
Google Scholar ID: WUaD4S0AAAAJ
postdoc at LTH
Computational Complexity
Proof Complexity
Follow
Homepage
↗
Google Scholar
↗
Citations & Impact
All-time
Citations
32
H-index
4
i10-index
0
Publications
9
Co-authors
10
list available
Publications
5 items
On Cutting Cakes and Crossing Curves
2026
Cited
0
Superpolynomial Length Lower Bounds for Tree-Like Semantic Proof Systems with Bounded Line Size
2026
Cited
0
Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz
IEEE Annual Symposium on Foundations of Computer Science · 2023
Cited
1
On Bounded Depth Proofs for Tseitin Formulas on the Grid; Revisited
IEEE Annual Symposium on Foundations of Computer Science · 2022
Cited
3
Exponential resolution lower bounds for weak pigeonhole principle and perfect matching formulas over sparse graphs
Electron. Colloquium Comput. Complex. · 2019
Cited
3
Co-authors
8 total
Susanna F. de Rezende
Lund University
Dmitry Sokolov
École Polytechnique Fédérale de Lausanne
Jakob Nordström
University of Copenhagen and Lund University
Johan Håstad
Professor i teoretisk datalogi, KTH
Mika Göös
EPFL
Gilbert Maystre
Oracle
Shuo Pang
Lecturer, University of Bristol
Jonas Conneryd
PhD Student, Lund University
