by Stasys Jukna
Abstract
We consider the size of monotone circuits for quadratic boolean functions, that is, disjunctions of length-$2$ monomials. Our motivation is that a good (linear in the number of variables) lower bound on the monotone circuit size for a certain type of quadratic function would imply a good (even exponential) lower bound on the general non-monotone circuit size.
To get more insight into the structure of monotone circuits for quadratic functions, we consider the so-called single level conjecture posed explicitly around 1990. The conjecture claims that monotone single level circuits, that is, circuits which have only one level of AND gates, for quadratic functions are not much larger than arbitrary monotone circuits. In this paper we disprove the conjecture: there are quadratic functions whose monotone circuits have linear size whereas their monotone single level circuits require almost quadratic size.