Skip to main content
Log in

On the Incompressibility of Monotone DNFs

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract

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 formulas 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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Matthias P. Krieger.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Krieger, M. On the Incompressibility of Monotone DNFs. Theory Comput Syst 41, 211–231 (2007). https://doi.org/10.1007/s00224-007-2013-z

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-007-2013-z

Keywords

Navigation