Kilian Risse

Orcid: 0000-0002-6913-3341

According to our database1, Kilian Risse authored at least 9 papers between 2019 and 2024.

Collaborative distances:

Timeline

2019
2020
2021
2022
2023
2024
0
1
2
3
4
2
1
1
1
1
2
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Supercritical Tradeoffs for Monotone Circuits.
Electron. Colloquium Comput. Complex., 2024

Clique Is Hard on Average for Sherali-Adams with Bounded Coefficients.
CoRR, 2024

2023
Sum-of-Squares Lower Bounds for the Minimum Circuit Size Problem.
Electron. Colloquium Comput. Complex., 2023

Clique Is Hard on Average for Unary Sherali-Adams.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022
Perfect Matching in Random Graphs is as Hard as Tseitin.
TheoretiCS, 2022

On Bounded Depth Proofs for Tseitin Formulas on the Grid; Revisited.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021
Average-Case Perfect Matching Lower Bounds from Hardness of Tseitin Formulas.
Electron. Colloquium Comput. Complex., 2021

2019
Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs.
Electron. Colloquium Comput. Complex., 2019


  Loading...