CLIQUE as an AND of Polynomial-Sized Monotone Constant-Depth Circuits

This paper shows that calculating $k$-CLIQUE on $n$ vertex graphs, requires the AND of at least $2^{n\mathrm{/}4k}$ monotone, constant-depth, and polynomial-sized circuits, for sufficiently large values of $k$. The proof relies on a new, monotone, one-sided switching lemma, designed for cliques.