Abstract
In their pioneering work of 1984, Furst, Saxe and Sipser introduced the method of “random restrictions” to achieve lower bounds for circuits: The parity function cannot be computed by an AND-OR circuit of polynomial size and constant depth.
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.
References
Furst, Saxe, Sipser: Parity, circuits, and the polynomial-time hierarchy, Mathematical Systems Theory 17 (1984) 13–27.
Hastad: Almost optimal lower bounds for small depth circuits, Proceedings of the 18th Annual Symposium on Theory of Computing, ACM, 1986, 6-12.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Schöning, U., Pruim, R. (1998). Lower Bounds for the Parity Function. In: Gems of Theoretical Computer Science. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-60322-8_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-60322-8_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-64352-1
Online ISBN: 978-3-642-60322-8
eBook Packages: Springer Book Archive