M. Abramowitz and I. A. Stegun, Handbook of mathematical functions with formulas, graphs, and mathematical tables, 1992.

M. Bardet, ´ Etude des systèmes algébriques surdéterminés. Applications aux codes correcteurs etàet`età la cryptographie, 2004.

B. Buchberger, Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal, 1965.

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
URL : http://doi.org/10.1016/s0747-7171(08)80013-2

T. W. Dubé, The Structure of Polynomial Ideals and Gr??bner Bases, SIAM Journal on Computing, vol.19, issue.4, pp.750-773, 1990.
DOI : 10.1137/0219053

C. Eder and J. Faugère, A survey on signature-based Gröbner basis computations, 2014.

C. Eder, J. Gash, and J. Perry, Modifying Faug??re's F5 algorithm to ensure termination, ACM Communications in Computer Algebra, vol.45, issue.1/2, pp.70-89, 2011.
DOI : 10.1145/2016567.2016574

J. Faugère, A new efficient algorithm for computing Gröbner bases (F 4 ), Journal of Pure and Applied Algebra, vol.139, pp.1-3, 1999.

J. Faugère, A new efficient algorithm for computing Gröbner bases without reduction to zero (F 5 ), proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation, pp.75-83, 2002.

J. Faugère, K. Fukuda, J. Hoeven, M. Joswig, and N. Takayama, FGb: A Library for Computing Gr??bner Bases, Mathematical Software -ICMS 2010, pp.84-87, 2010.
DOI : 10.1007/978-3-642-15582-6_17

J. C. Faugère, P. Gianni, D. Lazard, and T. Mora, Efficient Computation of Zero-dimensional Gr??bner Bases by Change of Ordering, Journal of Symbolic Computation, vol.16, issue.4, pp.329-344, 1993.
DOI : 10.1006/jsco.1993.1051

J. Faugère and A. Joux, Algebraic cryptanalysis of hidden field equation (HFE) cryptosystems using Gröbner bases, Crypto'2003. No. 2729 in Lecture Notes in Computer Science, pp.44-60, 2003.

J. Faugère and S. Rahmany, Solving Systems of Polynomial Equations with Symmetries Using SAGBI-Gröbner Bases, ISSAC '09: Proceedings of the 2009 International Symposium on Symbolic and Algebraic Computation, pp.151-158, 2009.

R. Gérard and W. B. Jurkat, Asymptotic implicit function theorems. Part I: the preparation theorem and division theorem, Asymptotic Analysis, vol.6, pp.45-71, 1992.

M. Giusti, Some effectivity problems in polynomial ideal theory, Lecture Notes in Computer Science, vol.174, pp.159-171, 1984.
DOI : 10.1007/BFb0032839

M. Giusti, A note on the complexity of constructing standard bases, Eurocal'85, pp.411-412, 1985.
DOI : 10.1007/3-540-15984-3_300

M. Giusti, Combinatorial dimension theory of algebraic varieties, Journal of Symbolic Computation, vol.623, pp.249-265, 1988.

M. Giusti, K. Hägele, G. Lecerf, J. Marchand, and B. Salvy, The Projective Noether Maple Package: Computing the Dimension of a Projective Variety, Journal of Symbolic Computation, vol.30, issue.3, pp.291-307, 2000.
DOI : 10.1006/jsco.2000.0369
URL : https://hal.archives-ouvertes.fr/inria-00073465

M. Giusti and J. Heintz, La détermination des points isolés et de la dimension d'une variété algébrique peut se faire en temps polynomial, Computational Algebraic Geometry and Commutative Algebra XXXIV of Sympos. Math, pp.216-256, 1991.

M. Giusti, G. Lecerf, and B. Salvy, A Gr??bner Free Alternative for Polynomial System Solving, Journal of Complexity, vol.17, issue.1, pp.154-211, 2001.
DOI : 10.1006/jcom.2000.0571

A. Hashemi and D. Lazard, Sharper complexity bounds for zero-dimensional Gröbner bases and polynomial system solving Hù ynh, D. T., 1986. A superexponential lower bound for Gröbner bases and Church-Rosser commutative Thue systems, International Journal of Algebra and Computation Information and Control, vol.2113, issue.68, pp.703-713, 2011.

T. Krick and L. M. Pardo, A computational method for diophantine approximation, Algorithms in Algebraic Geometry and Applications, pp.193-253, 1994.
DOI : 10.1007/978-3-0348-9104-2_11

Y. N. Lakshman, A single exponential bound on the complexity of computing Gröbner bases of zero-dimensional ideals, Effective Methods in Algebraic Geometry (Castiglioncello, pp.227-234, 1990.

Y. N. Lakshman and D. Lazard, On the Complexity of Zero-dimensional Algebraic Systems, In: Effective Methods in Algebraic Geometry (Castiglioncello Math. Birkhäuser Boston, vol.94, pp.217-225, 1990.
DOI : 10.1007/978-1-4612-0441-1_14

D. Lazard, Gröbner bases, Gaussian elimination and resolution of systems of algebraic equations, In: Computer algebra. Lecture Notes in Computer Science, vol.16283, pp.146-156, 1983.

L. Gall and F. , Powers of tensors and fast matrix multiplication, Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation, ISSAC '14, p.14, 2014.
DOI : 10.1145/2608628.2608664

M. Lejeune-jalabert, Effectivité de calculs polynomiaux, pp.84-85, 1984.

F. S. Macaulay, Some Formulae in Elimination, Proceedings of the London Mathematical Society, vol.1, issue.1, pp.3-27, 1902.
DOI : 10.1112/plms/s1-35.1.3

F. S. Macaulay, The algebraic theory of modular systems. Cambridge Mathematical Library, 1916.

E. W. Mayr and A. R. Meyer, The complexity of the word problems for commutative semigroups and polynomial ideals, Advances in Mathematics, vol.46, issue.3, pp.305-329, 1982.
DOI : 10.1016/0001-8708(82)90048-2

H. M. Möller and F. Mora, Upper and lower bounds for the degree of Groebner bases, Eurosam 84, pp.172-183, 1984.
DOI : 10.1007/BFb0032840

R. P. Stanley, Log-Concave and Unimodal Sequences in Algebra, Combinatorics, and Geometry, Annals of the New York Academy of Sciences, vol.1, issue.4, pp.500-535, 1986.
DOI : 10.2307/2325177

A. Storjohann, Algorithms for matrix canonical forms, 2000.

A. Stothers, On the complexity of matrix multiplication, 2010.

V. Williams and V. , Multiplying matrices faster than coppersmith-winograd, Proceedings of the 44th symposium on Theory of Computing, STOC '12, pp.887-898, 2012.
DOI : 10.1145/2213977.2214056
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.297.2680

J. Zur-gathen and J. Gerhard, Modern Computer Algebra, 2003.
DOI : 10.1017/CBO9781139856065