Search Results for author: Massimo Lauria

Found 1 papers, 0 papers with code

Clique Is Hard on Average for Regular Resolution

no code implementations17 Dec 2020 Albert Atserias, Ilario Bonacina, Susanna F. de Rezende, Massimo Lauria, Jakob Nordström, Alexander Razborov

We prove that for $k \ll \sqrt[4]{n}$ regular resolution requires length $n^{\Omega(k)}$ to establish that an Erd\H{o}s-R\'enyi graph with appropriately chosen edge density does not contain a $k$-clique.

Computational Complexity

Cannot find the paper you are looking for? You can Submit a new open access paper.