Abstract
We consider depth-2 and 3 circuits over the basis consisting of all Boolean functions. For depth-3 circuits, we prove a lower bound Ω(nlogn) for the size of any circuit computing the cyclic convolution. For depth-2 circuits, a lower bound Ω(n 3/2) for the same function was obtained in our previous paper [10]. Here we present an improved proof of this bound. Both lower bounds are the best known for depth-3 and depth-2 circuits, respectively.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Valiant, L.G.: Graph-theoretic arguments in low-level complexity. In: Gruska, J. (ed.) MFCS 1977. LNCS, vol. 53, pp. 162–176. Springer, Heidelberg (1977)
Pippenger, N.: Superconcentrators of depth 2. J. of Computer and System Sciences 24, 82–90 (1982)
Dolev, D., Dwork, C., Pippenger, N., Wigderson, A.: Superconcentrators, generalizers and generalized connectors with limited depth. In: Proc. 15th ACM STOC, pp. 42–51 (1983)
Pudlák, P., Savický, P.: On shifting networks. Theoretical Comput. Sci. 116, 415–419 (1993)
Pudlák, P.: Communication in Bounded Depth Circuits. Combinatorica 14(2), 203–216 (1994)
Alon, N., Pudlák, P.: Superconcentrators of depth 2 and 3; odd levels help (rarely). J. of Computer and System Sciences 48, 194–202 (1994)
Pudlák, P., Rödl, V., Sgall, J.: Boolean circuits, tensor ranks and communication complexity. SIAM J. on Computing 26(3), 605–633 (1997)
Radhakrishnan, J., Ta-Shma, A.: Bounds for dispersers, extractors and depth-two superconcentrators. SIAM J. of Discrete Mathematics 13(1), 2–24 (2000)
Raz, R., Shpilka, A.: Lower Bounds for Matrix Product, in Bounded Depth Circuits with Arbitrary Gates. SIAM J. Comput. 32(2), 488–513 (2003)
Cherukhin, D.Y.: The lower estimate of complexity in the class of schemes of depth 2 without restrictions on a basis. Moscow Univ. Math. Bull. 60(4), 42–44 (2005)
Jukna, S.: Entropy of operators or why matrix multiplication is hard for depth-two circuits (manuscript, 2008), www.thi.informatik.uni-frankfurt.de/~yukna
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cherukhin, D.Y. (2008). Lower Bounds for Depth-2 and Depth-3 Boolean Circuits with Arbitrary Gates. In: Hirsch, E.A., Razborov, A.A., Semenov, A., Slissenko, A. (eds) Computer Science – Theory and Applications. CSR 2008. Lecture Notes in Computer Science, vol 5010. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79709-8_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-79709-8_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-79708-1
Online ISBN: 978-3-540-79709-8
eBook Packages: Computer ScienceComputer Science (R0)