Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs. - Susanna F. de Rezende; Jakob Nordström; Kilian Risse; Dmitry Sokolov 001 (Electron. Colloquium Comput. Complex., 2019)

Average-Case Perfect Matching Lower Bounds from Hardness of Tseitin Formulas. - Per Austrin; Kilian Risse (Electron. Colloquium Comput. Complex., 2021)

On Bounded Depth Proofs for Tseitin Formulas on the Grid; Revisited. - Johan Håstad; Kilian Risse (FOCS, 2022)

Perfect Matching in Random Graphs is as Hard as Tseitin. - Per Austrin; Kilian Risse (TheoretiCS, 2022)

Clique Is Hard on Average for Unary Sherali-Adams. - Susanna F. de Rezende; Aaron Potechin; Kilian Risse (FOCS, 2023)

Sum-of-Squares Lower Bounds for the Minimum Circuit Size Problem. - Per Austrin; Kilian Risse (Electron. Colloquium Comput. Complex., 2023)

Clique Is Hard on Average for Sherali-Adams with Bounded Coefficients. - Susanna F. de Rezende; Aaron Potechin; Kilian Risse (CoRR, 2024)

Supercritical Tradeoffs for Monotone Circuits. - Mika Göös; Gilbert Maystre; Kilian Risse; Dmitry Sokolov 001 (Electron. Colloquium Comput. Complex., 2024)

Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz. - Jonas Conneryd; Susanna F. de Rezende; Jakob Nordström; Shuo Pang 002; Kilian Risse (Electron. Colloquium Comput. Complex., 2025)