CLIQUE as an AND of Polynomial-Sized Monotone Constant-Depth Circuits
Abstract
This paper shows that calculating k-CLIQUE on n vertex graphs, requires the AND of at least 2n/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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.