Monotone Circuit Complexity of Matching
Abstract
We show that the perfect matching function on n-vertex graphs requires monotone circuits of size 2n(1). This improves on the n( n) lower bound of Razborov (1985). Our proof uses the standard approximation method together with a new sunflower lemma for matchings.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.