L. Lovász, On determinants, matching, and random algorithms, FCT'79: Fundamentals of Computation Theory, pp.565-574, 1979.

J. Edmonds, Systems of distinct representatives and linear algebra, Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, vol.71, issue.4, pp.241-245, 1967.
DOI : 10.6028/jres.071B.033

Z. Dvir, A. Shpilka, and A. Yehudayoff, Hardness-randomness tradeoffs for bounded depth circuits, Proceedings of the 40th Annual STOC, pp.741-748, 2008.

M. Mahajan and V. Vinay, Determinant: Combinatorics, algorithms, and complexity, Chicago Journal of Theoretical Computer Science, 1997.

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

J. T. 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

N. Saxena, G. Ivanyos, and M. Karpinksi, Deterministic polynomial time algorithms for matrix completion problems, Electronic Colloquium in Computational Complexity, 2009.

V. Kabanets and R. Impagliazzo, Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds, computational complexity, vol.13, issue.1-2, pp.1-44, 2004.
DOI : 10.1007/s00037-004-0182-6

T. Mignon and N. Ressayre, A quadratic bound for the determinant and permanent problem, International Mathematics Research Notices, pp.4241-4253, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00818200

P. Bürgisser, M. Claussen, and M. A. Shokrollahi, Algebraic Complexity Theory, 1997.
DOI : 10.1007/978-3-662-03338-8

L. 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

N. Nisan and A. Wigderson, Hardness vs randomness, Journal of Computer and System Sciences, vol.49, issue.2, pp.149-167, 1994.
DOI : 10.1016/S0022-0000(05)80043-1

URL : http://doi.org/10.1016/s0022-0000(05)80043-1

S. 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

P. A. Samuelson, A Method of Determining Explicitly the Coefficients of the Characteristic Equation, The Annals of Mathematical Statistics, vol.13, issue.4, pp.424-429, 1942.
DOI : 10.1214/aoms/1177731540