S. J. Berkowitz, On computing the determinant in small parallel time using a small number of processors, Information Processing Letters, vol.18, issue.3, pp.147-150, 1984.
DOI : 10.1016/0020-0190(84)90018-8

J. Canny, Generalized characteristic polynomials, J. Symbolic Comput, vol.9, issue.3, pp.241-250, 1990.
DOI : 10.1007/3-540-51084-2_28

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

A. L. Chistov, Fast parallel calculation of the rank of matrices over a field of arbitrary characteristic, Proc. FCT '85, pp.63-69, 1985.
DOI : 10.1007/BFb0028792

D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progressions, Proceedings of the nineteenth annual ACM conference on Theory of computing , STOC '87, pp.251-280, 1990.
DOI : 10.1145/28395.28396

D. Eisenbud, F. Schreyer, and J. Weyman, Resultants and Chow forms via exterior syzygies, Journal of the American Mathematical Society, vol.16, issue.03, pp.537-579, 2003.
DOI : 10.1090/S0894-0347-03-00423-5

J. Von-zur-gathen, G. , and J. , Modern Computer Algebra, 1999.
DOI : 10.1017/CBO9781139856065

E. Kaltofen, Greatest common divisors of polynomials given by straight-line programs, Journal of the ACM, vol.35, issue.1, pp.231-264, 1988.
DOI : 10.1145/42267.45069

E. Kaltofen and G. Villard, On the complexity of computing determinants, computational complexity, vol.13, issue.3-4, pp.91-130, 2004.
DOI : 10.1007/s00037-004-0185-3

A. Khetan, Determinantal formula for the chow form of a toric surface, Proceedings of the 2002 international symposium on Symbolic and algebraic computation , ISSAC '02, pp.145-150, 2002.
DOI : 10.1145/780506.780525

. Khetan, . Amit, . Song, . Ning, and R. Goldman, Sylvester-resultants for bivariate polynomials with planar newton polygons, Proceedings of the 2004 international symposium on Symbolic and algebraic computation , ISSAC '04, 2004.
DOI : 10.1145/1005285.1005316

. Internat and . Symp, Symbolic Algebraic Comput, pp.205-212, 2004.

S. R. Kosaraju and A. L. Delcher, Optimal parallel evaluation of tree-structured computations by raking (extended abstract), Proc. AWOC 88, pp.101-110, 1988.
DOI : 10.1007/BFb0040378

F. S. Macaulay, The Algebraic Theory of Modular Systems Number 19 in Cambridge Tracts, Reissued in the Cambridge Mathematical Library with an Introduction by Paul Roberts, 1916.

G. Malod and N. Portier, Characterizing Valiant's algebraic complexity classes, Journal of Complexity, pp.2005-2049, 2007.

G. L. Miller, V. Ramachandran, and E. Kaltofen, Efficient parallel evaluation of straight-line code and arithmetic circuits, SIAM J. Comput, vol.17, issue.4, pp.687-695, 1988.
DOI : 10.1007/3-540-16766-8_21

T. Sasaki and H. Murao, Efficient Gaussian Elimination Method for Symbolic Determinants and Linear Systems, ACM Transactions on Mathematical Software, vol.8, issue.3, pp.277-289, 1982.
DOI : 10.1145/356004.356007

J. Schwartz, Fast Probabilistic Algorithms for Verification of Polynomial Identities, Journal of the ACM, vol.27, issue.4, pp.701-717, 1980.
DOI : 10.1145/322217.322225

S. Toda, Classes of arithmetic circuits capturing the complexity of computing the determinant, IEICE Transactions on Information and Systems, issue.1, pp.116-124, 1992.

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

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

R. Zippel, Probabilistic algorithms for sparse polynomials, Symbolic and Algebraic Computation Proc. EUROSAM '79, pp.216-226, 1979.
DOI : 10.1007/3-540-09519-5_73