Kilian Risse
Scholar

Kilian Risse

Google Scholar ID: WUaD4S0AAAAJ
postdoc at LTH
Computational ComplexityProof Complexity
Homepage↗Google Scholar↗
Citations & Impact
All-time
Citations
32
 
H-index
4
 
i10-index
0
 
Publications
9
 
Co-authors
10
list available
Contact
No contact links provided.
Publications
4 items
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
Resume (English only)
Co-authors
10 total
Susanna F. de Rezende
Susanna F. de Rezende
Lund University
Co-author 2
Co-author 2
Dmitry Sokolov
Dmitry Sokolov
École Polytechnique Fédérale de Lausanne
Jakob Nordström
Jakob Nordström
University of Copenhagen and Lund University
Co-author 5
Co-author 5
Johan Håstad
Johan Håstad
Professor i teoretisk datalogi, KTH
Mika Göös
Mika Göös
EPFL
Gilbert Maystre
Gilbert Maystre
Oracle