Kilian Risse

Average-Case Perfect Matching Lower Bounds from Hardness of Tseitin Formulas

Per Austrin, Kilian Risse, Per Austrin, 2021, Electron. Colloquium Comput. Complex..

Exponential resolution lower bounds for weak pigeonhole principle and perfect matching formulas over sparse graphs

Dmitry Sokolov, Susanna F. de Rezende, Jakob Nordström, 2019, Electron. Colloquium Comput. Complex..

Sum-of-Squares Lower Bounds for the Minimum Circuit Size Problem

Per Austrin, Kilian Risse, 2023, Electron. Colloquium Comput. Complex..