Monotone Formulas

Chapter
Part of the Algorithms and Combinatorics book series (AC, volume 27)

Abstract

We have seen that proving lower bound for general circuits is a very difficult task. Thus it is natural to try to obtain large lower bounds for a more restricted class of circuits, the class of monotone circuits. Monotone circuits consist only of AND and OR gates and have no NOT gates. Of course, such circuits cannot compute all boolean functions.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  1. 1.Institute of InformaticsUniversity of FrankfurtFrankfurt am MainGermany
  2. 2.Institute of Mathematics and InformaticsVilnius UniversityVilniusLithuania

Personalised recommendations