Abstract
We consider boolean circuits with unbounded-fanin AND and OR gates. Inputs are variables and their negations. Conjunctive and disjunctive normal forms are such circuits of depth two, and exponential lower bounds for them are easy to prove.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Jukna, S. (2012). Depth-3 Circuits. In: Boolean Function Complexity. Algorithms and Combinatorics, vol 27. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24508-4_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-24508-4_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24507-7
Online ISBN: 978-3-642-24508-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)