Prati
Kilian Risse
Kilian Risse
postdoc at EPFL
Potvrđena adresa e-pošte na epfl.ch - Početna stranica
Naslov
Citirano
Citirano
Godina
Exponential resolution lower bounds for weak pigeonhole principle and perfect matching formulas over sparse graphs
SF de Rezende, J Nordström, K Risse, D Sokolov
arXiv preprint arXiv:1912.00534, 2019
82019
Clique is hard on average for unary Sherali-Adams
SF De Rezende, A Potechin, K Risse
2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), 12-25, 2023
32023
Perfect matching in random graphs is as hard as Tseitin
P Austrin, K Risse
TheoretiCS 1, 2022
32022
On bounded depth proofs for tseitin formulas on the grid; revisited
J Håstad, K Risse
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
32022
Clique Is Hard on Average for Sherali-Adams with Bounded Coefficients
SF de Rezende, A Potechin, K Risse
arXiv preprint arXiv:2404.16722, 2024
2024
Sum-Of-Squares Lower Bounds for the Minimum Circuit Size Problem
P Austrin, K Risse
arXiv preprint arXiv:2311.12994, 2023
2023
Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz
J Conneryd, SF De Rezende, J Nordström, S Pang, K Risse
2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), 1-11, 2023
2023
On Long Proofs of Simple Truths
K Risse
KTH Royal Institute of Technology, 2022
2022
Sustav trenutno ne može provesti ovu radnju. Pokušajte ponovo kasnije.
Članci 1–8