On the Incompressibility of Monotone DNFs
We prove optimal lower bounds for multilinear circuits and for monotone circuits with bounded depth. These lower bounds state that, in order to compute certain functions, these circuits need exactly as many OR gates as the respective DNFs. The proofs exploit a property of the functions that is based solely on prime implicant structure. Due to this feature, the lower bounds proved also hold for approximations of the considered functions that are similar to slice functions. Known lower bound arguments cannot handle these kinds of approximations. In order to show limitations of our approach, we prove that cliques of size n–1 can be detected in a graph with n vertices by monotone formulae with O(log n) OR gates.
Our lower bound for multilinear circuits improves a lower bound due to Borodin, Razborov and Smolensky for nondeterministic read-once branching programs computing the clique function.
KeywordsBoolean Function Boolean Circuit Prime Implicants Slice Function Monotone Circuit
Unable to display preview. Download preview PDF.
- 8.Savage, J.E.: Models of computation: Exploring the power of computing. Addison- Wesley Publishing Company, Reading 1998)Google Scholar
- 9.Sengupta, R., Venkateswaran, H.: Multilinearity can be exponentially restrictive (preliminary version). Technical Report GIT-CC-94-40, Georgia Institute of Technology. College of Computing (1994)Google Scholar
- 11.Wegener, I.: Branching programs and binary decision diagrams. Theory and applications. SIAM Monographs on Discrete Mathematics and Applications (2000)Google Scholar
- 12.Nisan, N., Wigderson, A.: Lower bounds on arithmetic circuits via partial derivatives. Comput. Complexity 6, 217–234 (1996/1997)Google Scholar
- 13.Raz, R.: Multi-linear formulas for permanent and determinant are of superpolynomial size. In: Babai, L. (ed.) STOC, pp. 633–641. ACM, New York (2004)Google Scholar
- 14.Raz, R.: Multilinear-NC1 ≠ Multilinear-NC2. In: FOCS, pp. 344–351. IEEE Computer Society, Los Alamitos (2004)Google Scholar