Abstract
The main difficulty in proving nontrivial lower bounds on the size of circuits using AND, OR and NOT is the presence of NOT gates—we already know how to prove even exponential lower bounds for monotone functions if no NOT gates are allowed.
This is a preview of subscription content, log in via an institution to check access.
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). The Mystery of Negations. In: Boolean Function Complexity. Algorithms and Combinatorics, vol 27. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24508-4_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-24508-4_10
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)