E. Becker, J. Cardinal, M. Roy, and Z. Szafraniec, Multivariate Bezoutians, Kronecker symbol and Eisenbud-Levin formula, Algorithms in Algebraic Geometry and Applications, pp.79-104, 1996.
DOI : 10.1007/978-3-0348-9104-2_5

E. Bézout, Recherches sur les degrés deséquationsdeséquations résultantes de l'´ evanouissement des inconnues et sur les moyens qu'il convient d'employer pour trouver ceséquationsceséquations, Hist. de l'Acad. Roy. des Sciences, pp.288-338, 1764.

D. Bondyfalat, B. Mourrain, and V. Pan, Controlled iterative methods for solving polynomial systems, Proceedings of the 1998 international symposium on Symbolic and algebraic computation , ISSAC '98, pp.252-259, 1998.
DOI : 10.1145/281508.281629

J. Canny, I. Emiris, G. Cohen, T. Mora, and O. Moreno, An efficient algorithm for the sparse mixed resultant, Proc. Intern. Symp. Applied Algebra, Algebraic Algor. and Error-Corr. Codes (Puerto Rico), volume 263 of Lect. Notes in Comp. Science, pp.89-104, 1993.
DOI : 10.1007/3-540-56686-4_36

J. Cardinal and B. Mourrain, Algebraic approach of residues and applications, Proc. AMS-SIAM Summer Seminar on Math. of Numerical Analysis, pp.189-210, 1995.

M. Chardin, Multivariate subresultants, Journal of Pure and Applied Algebra, vol.101, issue.2, pp.129-138, 1995.
DOI : 10.1016/0022-4049(95)90926-C

A. Chistov, Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time, Journal of Soviet Mathematics, vol.100, issue.No. 4, pp.1838-1882, 1986.
DOI : 10.1007/BF01095643

A. Dixon, The Eliminant of Three Quantics in two Independent Variables, Proceedings of the London Mathematical Society, vol.2, issue.1, pp.49-69, 1908.
DOI : 10.1112/plms/s2-7.1.49

D. Eisenbud, Commutative Algebra with a view toward Algebraic Geometry, Graduate Texts in Math, vol.150, 1994.

M. Elkadi and B. Mourrain, Approche effective des résidus algébriques, 1996.

M. Elkadi and B. Mourrain, Algorithms for residues and Lojasiewicz exponents, Journal of Pure and Applied Algebra, vol.153, issue.1, 1999.
DOI : 10.1016/S0022-4049(99)00083-3
URL : http://doi.org/10.1016/s0022-4049(99)00083-3

M. Elkadi and B. Mourrain, A new algorithm for the geometric decomposition of a variety, Proceedings of the 1999 international symposium on Symbolic and algebraic computation , ISSAC '99, pp.9-16, 1999.
DOI : 10.1145/309831.309843

I. Gelfand, M. Kapranov, and A. Zelevinsky, Discriminants, Resultants and Multidimensional Determinants, 1994.
DOI : 10.1007/978-0-8176-4771-1

D. Grigoryev, Factorization of polynomials over a finite field and the solution of systems of algebraic equations, Journal of Soviet Mathematics, vol.100, issue.No. 4, pp.1762-1803, 1986.
DOI : 10.1007/BF01095638

J. Harris, Algebraic Geometry, a first course, Graduate Texts in Math, vol.133, 1992.

J. Jouanolou, Le formalisme du r??sultant, Advances in Mathematics, vol.90, issue.2, pp.117-263, 1991.
DOI : 10.1016/0001-8708(91)90031-2
URL : http://doi.org/10.1016/0001-8708(91)90031-2

D. Kapur, T. Saxena, and L. Yang, Algebraic and geometric reasoning using Dixon resultants, Proceedings of the international symposium on Symbolic and algebraic computation , ISSAC '94, pp.99-107, 1994.
DOI : 10.1145/190347.190372
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.8849

E. Kunz, Kähler differentials Advanced lectures in Mathematics. Friedr, 1986.

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

D. Manocha, Solving systems of polynomial equations, IEEE Computer Graphics and Applications, vol.14, issue.2, pp.46-55, 1994.
DOI : 10.1109/38.267470

D. Manocha and J. Canny, MultiPolynomial Resultant Algorithms, Journal of Symbolic Computation, vol.15, issue.2, pp.99-122, 1993.
DOI : 10.1006/jsco.1993.1009
URL : http://doi.org/10.1006/jsco.1993.1009

B. Mourrain, Enumeration problems in geometry, robotics and vision, Algorithms in Algebraic Geometry and Applications, pp.285-306, 1996.
DOI : 10.1007/978-3-0348-9104-2_14

B. Mourrain, Computing isolated polynomial roots by matrix methods, J. of Symbolic Computation , Special Issue on Symbolic-Numeric Algebra for Polynomials, vol.26, issue.6, pp.715-738, 1998.

P. S. Pedersen and B. Sturmfels, Product formulas for resultants and Chow forms, Mathematische Zeitschrift, vol.46, issue.no. 2, pp.377-396, 1993.
DOI : 10.1007/BF02572411

G. Salmon, Lessons Introductory to the Modern Higher Algebra, 1885.

G. Scheja and U. Storch, ¨ Uber Spurfunktionen bei vollständigen Durschnitten, J. Reine Angew Mathematik, vol.278, pp.174-190, 1975.

I. Shafarevitch, Basic Algebraic Geometry, 1974.

B. Sturmfels, Sparse elimination theory, Computational Algebraic Geometry and Commutative AlgebraProc. Cortona, pp.264-298, 1991.

J. Sylvester, Examples of the dialytic method of elimination as applied to ternary systems of equations, Cambridge Math. J, vol.ii, pp.232-236, 1841.

B. Van-der-waerden, Modern algebra, 1948.