M. Ajtai, ???11-Formulae on finite structures, Annals of Pure and Applied Logic, vol.24, issue.1, pp.1-48, 1983.
DOI : 10.1016/0168-0072(83)90038-6

URL : http://doi.org/10.1016/0168-0072(83)90038-6

D. A. Barrington, R. Beigel, and S. Rudich, Representing Boolean functions as polynomials modulo composite numbers, Proc. 24th Ann. ACM Symp. Theor. Comput, pp.367-382, 1992.
DOI : 10.1007/BF01263424

URL : http://1013seopc.eecs.uic.edu/papers/bbr-mods-cc.PS.gz

D. A. Barrington, H. Straubing, and D. Thérien, Non-uniform automata over groups. Information and Computation, pp.109-132, 1990.
DOI : 10.1007/3-540-18088-5_13

URL : http://dx.doi.org/10.1016/0890-5401(90)90007-5

R. Beigel and J. Tarui, On ACC, Computational Complexity, vol.21, issue.2, pp.350-366, 1994.
DOI : 10.1007/BF01263423

M. L. Furst, J. B. 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

V. Grolmusz, A weight-size trade-off for circuits with MOD m gates, Proceedings of the twenty-sixth annual ACM symposium on Theory of computing , STOC '94, pp.68-74, 1994.
DOI : 10.1145/195058.195108

V. Grolmusz, On the weak mod m representation of Boolean functions, Chicago Journal of Theoretical Computer Science, issue.2, 1995.

V. Grolmusz, Separating the communication complexities of MOD m and MOD p circuits, Proceedings., 33rd Annual Symposium on Foundations of Computer Science, pp.307-313, 1992.
DOI : 10.1109/SFCS.1992.267764

J. Håstad, Almost optimal lower bounds for small depth circuits, Proceedings of the eighteenth annual ACM symposium on Theory of computing , STOC '86, pp.6-20, 1986.
DOI : 10.1145/12130.12132

J. Kahn and R. Meshulam, On mod p transversals, Combinatorica, vol.10, issue.1, pp.17-22, 1991.

M. Krause and P. Pudlák, On the computational power of depth 2 circuits with threshold and modulo gates, Proc. 26th Ann. ACM Symp. Theor. Comput, 1994.

M. Krause and S. Waack, Variation ranks of communication matrices and lower bounds for depth-two circuits having nearly symmetric gates with unbounded fan-in, Mathematical Systems Theory, vol.41, issue.6, pp.553-564, 1995.
DOI : 10.1007/BF01204170

A. Razborov, Lower bounds for the monotone complexity of some Boolean functions, Sov. Math. Dokl, vol.31, pp.354-357, 1985.

A. Razborov, Lower bounds on the size of bounded depth networks over a complete basis with logical addition, Russian). Mat. Zametki, pp.598-607, 1987.

R. Smolensky, Algebraic methods in the theory of lower bounds for Boolean circuit complexity, Proceedings of the nineteenth annual ACM conference on Theory of computing , STOC '87, pp.77-82, 1987.
DOI : 10.1145/28395.28404

R. Smolensky, On interpolation by analytic functions with special properties and some weak lower bounds on the size of circuits with symmetric gates, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science, pp.628-631, 1990.
DOI : 10.1109/FSCS.1990.89584

M. Szegedy, gates, Proceedings of the twenty-second annual ACM symposium on Theory of computing , STOC '90, pp.278-286, 1990.
DOI : 10.1145/100216.100252

G. Tardos and D. A. Barrington, A lower bound on the mod 6 degree of the OR function, Computational Complexity, vol.7, issue.2, pp.99-108, 1998.
DOI : 10.1007/PL00001597

S. Toda, PP is as Hard as the Polynomial-Time Hierarchy, SIAM Journal on Computing, vol.20, issue.5, pp.865-877, 1991.
DOI : 10.1137/0220053

P. Yan and I. Parberry, Exponential Size Lower Bounds for Some Depth 3 Circuits, Information and Computation, vol.112, issue.1, pp.117-130, 1994.
DOI : 10.1006/inco.1994.1054

URL : http://doi.org/10.1006/inco.1994.1054

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

A. C. Yao, ON ACC and threshold circuits, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science, pp.619-627, 1990.
DOI : 10.1109/FSCS.1990.89583