L. Babai and &. L. Fortnow, Arithmetization: A new method in structural complexity theory, Computational Complexity, vol.47, issue.1, pp.41-66, 1991.
DOI : 10.1007/BF01200057

W. Baur and &. V. Strassen, The complexity of partial derivatives', Theor, Comp. Sci, vol.22, pp.317-330, 1982.

M. Bläser, Complete Problems for Valiant???s Class of qp-Computable Families of Polynomials, Proc. 7th Ann. Int. Computing and Combinatorics Conf. (COCOON), 2001.
DOI : 10.1007/3-540-44679-6_1

P. Bürgisser, Completeness and reduction in algebraic complexity theory, 2000.
DOI : 10.1007/978-3-662-04179-6

D. G. Cantor and &. E. Kaltofen, On fast multiplication of polynomials over arbitrary algebras, Acta Informatica, vol.7, issue.7, pp.693-701, 1991.
DOI : 10.1007/BF01178683

J. Zur-gathen, Feasible arithmetic computations: Valiant's hypothesis, Journal of Symbolic Computation, vol.4, issue.2, pp.137-172, 1987.
DOI : 10.1016/S0747-7171(87)80063-9

J. Hammond, Question 6001, Educ. Times, vol.32, issue.179, 1879.

M. Jerrum and &. M. Snir, Some Exact Complexity Results for Straight-Line Computations over Semirings, Journal of the ACM, vol.29, issue.3, pp.874-897, 1982.
DOI : 10.1145/322326.322341

E. Kaltofen, Factorization of polynomials given by straight-line programs, Randomness and Computation, pp.375-412, 1989.

E. Kaltofen, Single-factor Hensel lifting and its application to the straight-line complexity of certain polynomials, Proceedings of the nineteenth annual ACM conference on Theory of computing , STOC '87, pp.443-452, 1987.
DOI : 10.1145/28395.28443

E. Kaltofen, &. M. Singer, D. V. Shirkov, V. A. Rostovtsev, and V. P. Gerdt, Size efficient parallel algebraic circuits for partial derivatives, IV International Conference on Computer Algebra in Physical Research, pp.133-145, 1991.

M. Mahajan and &. V. Vinay, Determinant: Old Algorithms, New Insights, SIAM Journal on Discrete Mathematics, vol.12, issue.4, pp.474-490, 1999.
DOI : 10.1137/S0895480198338827

B. Poizat, Les petits cailloux (Nur al-mantiq wal-ma'rifah, 1995.

N. Portier, Abstract, The Journal of Symbolic Logic, vol.59, issue.02, pp.803-816, 1999.
DOI : 10.1007/BF02757008

R. Sengupta and &. H. Venkatsewaran, A lower bound for monotone arithmetic circuits computing 0???1 permanent, Theoretical Computer Science, vol.209, issue.1-2, pp.389-398, 1998.
DOI : 10.1016/S0304-3975(98)00130-3

L. G. Valiant, Completeness classes in algebra, Proceedings of the eleventh annual ACM symposium on Theory of computing , STOC '79, pp.249-261, 1979.
DOI : 10.1145/800135.804419

L. G. Valiant, Reducibility by algebraic projections', Logic and algorithmic : an international symposium held in honor of Ernst Specker , Monogr. No. 30 de l'Enseign, Math, pp.365-380, 1982.

L. G. Valiant, An algebraic approach to computational complexity, Proc. Int. Congress of Mathematicians, pp.1637-1644, 1983.

L. G. Valiant, Why is boolean complexity difficult ?, Lecture Notes Series 169, 1992.
DOI : 10.1017/cbo9780511526633.008

L. G. Valiant, S. Skyum, S. Berkowitz, and &. C. Rackoff, Fast Parallel Computation of Polynomials Using Few Processors, SIAM Journal on Computing, vol.12, issue.4, pp.641-644, 1983.
DOI : 10.1137/0212043

H. Vollmer, Introduction to circuit complexity. A uniform approach. Texts in Theoretical Computer Science. An EATCS Series, 1999.
DOI : 10.1007/978-3-662-03927-4

I. Wegener, The complexity of Boolean functions Wiley-Teubner Series in Computer Science, Ltd., Chichester ; B. G. Teubner, 1987.