A. Bernasconi, On the complexity of balanced Boolean functions, Information Processing Letters, vol.70, issue.4, pp.157-163, 1999.
DOI : 10.1016/S0020-0190(99)00061-7

A. Bernasconi, C. Damm, and I. E. Shparlinski, Circuit and Decision Tree Complexity of Some Number Theoretic Problems, Information and Computation, vol.168, issue.2, 2000.
DOI : 10.1006/inco.2000.3017

A. Bernasconi and I. E. Shparlinski, Circuit Complexity of Testing Square-Free Numbers, Proceedings of the 16th Ann. Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science 1563, pp.47-56, 1999.
DOI : 10.1007/3-540-49116-3_4

M. Furst, J. Saxe, and M. Sipser, Parity, circuits, and the polynomial-time hierarchy, Mathematical Systems Theory, vol.3, issue.1, pp.13-27, 1984.
DOI : 10.1007/BF01744431

J. H. Astad, Computational limitations for small depth circuits, 1986.

S. L. Hurst, D. M. Miller, and J. C. Muzio, Spectral method of Boolean function complexity, Electronics Letters, vol.18, issue.13, pp.572-574, 1982.
DOI : 10.1049/el:19820387

R. J. Lechner, HARMONIC ANALYSIS OF SWITCHING FUNCTIONS, Recent Development in Switching Theory, pp.122-229, 1971.
DOI : 10.1016/B978-0-12-509850-2.50010-5

N. Linial, Y. Mansour, and N. Nisan, Constant depth circuits, Fourier transform, and learnability, Journal of the ACM, vol.40, issue.3, pp.607-620, 1993.
DOI : 10.1145/174130.174138

H. U. Simon, A tight ?(log log n) bound on the time for parallel RAM's to compute nondegenerate Boolean functions. FCT'83, Lecture Notes in Computer Science, vol.158, 1983.

I. Wegener, The complexity of Boolean functions, Teubner Series in Comp. Sci, 1987.

A. C. Yao, Separating the polynomial-time hierarchy by oracles, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), pp.1-10, 1985.
DOI : 10.1109/SFCS.1985.49