Kilian Risse

activity

20192026

most citedPerfect Matching in Random Graphs is as Hard as Tseitin

1 citations · 2 across the 9 of their papers we have counts for

collaborators

Showing 2024Show all

2 papers · 1 filter

cs.CC2024

Supercritical Tradeoffs for Monotone Circuits

Mika Göös, Gilbert Maystre, Kilian Risse +1

We exhibit a monotone function computable by a monotone circuit of quasipolynomial size such that any monotone circuit of polynomial depth requires exponential size. This is the fi…

cs.CC2024

Clique Is Hard on Average for Sherali-Adams with Bounded Coefficients

Susanna F. de Rezende, Aaron Potechin, Kilian Risse

We prove that Sherali-Adams with polynomially bounded coefficients requires proofs of size $n^{Ω (d)}$ to rule out the existence of an $n^{Θ (1)}$ -clique in Erdős-Rényi random graphs…