Lower Bounds for Depth-2 and Depth-3 Boolean Circuits with Arbitrary Gates

  • Dmitriy Yu. Cherukhin
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5010)


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.


Boolean function circuit complexity depth lower bound cyclic convolution 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    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)Google Scholar
  2. 2.
    Pippenger, N.: Superconcentrators of depth 2. J. of Computer and System Sciences 24, 82–90 (1982)CrossRefMathSciNetzbMATHGoogle Scholar
  3. 3.
    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)Google Scholar
  4. 4.
    Pudlák, P., Savický, P.: On shifting networks. Theoretical Comput. Sci. 116, 415–419 (1993)CrossRefzbMATHGoogle Scholar
  5. 5.
    Pudlák, P.: Communication in Bounded Depth Circuits. Combinatorica 14(2), 203–216 (1994)CrossRefMathSciNetzbMATHGoogle Scholar
  6. 6.
    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)CrossRefzbMATHGoogle Scholar
  7. 7.
    Pudlák, P., Rödl, V., Sgall, J.: Boolean circuits, tensor ranks and communication complexity. SIAM J. on Computing 26(3), 605–633 (1997)CrossRefzbMATHGoogle Scholar
  8. 8.
    Radhakrishnan, J., Ta-Shma, A.: Bounds for dispersers, extractors and depth-two superconcentrators. SIAM J. of Discrete Mathematics 13(1), 2–24 (2000)CrossRefMathSciNetzbMATHGoogle Scholar
  9. 9.
    Raz, R., Shpilka, A.: Lower Bounds for Matrix Product, in Bounded Depth Circuits with Arbitrary Gates. SIAM J. Comput. 32(2), 488–513 (2003)CrossRefMathSciNetzbMATHGoogle Scholar
  10. 10.
    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)MathSciNetGoogle Scholar
  11. 11.
    Jukna, S.: Entropy of operators or why matrix multiplication is hard for depth-two circuits (manuscript, 2008),

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Dmitriy Yu. Cherukhin
    • 1
  1. 1.Mech. and Math. FacultyMoscow State University, Leninskie GoryMoscowRussia

Personalised recommendations