Generalized Resultants over Unirational Algebraic Varieties

Becker, 1996, Multivariate Bezoutians, Kronecker symbol and Eisenbud–Levin formula, 79

Bézout, 1764, Recherches sur les degrés des équations résultantes de l’évanouissement des inconnues et sur les moyens qu’il convient d’employer pour trouver ces équations, Hist. Acad. R. Sci., 288

D. Bondyfalat, B. Mourrain, V. Pan, Proceedings of ISSAC, Gloor, O. 1998, ACM Press, New York, 252, 259

J. Canny, I. Emiris, Proceedings of International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correction Codes, Puerto Rico, Cohen, G.Mora, T.Moreno, O. 1993, Springer-Verlag, 89, 104

J. Cardinal, B. Mourrain, Proceedings of the AMS-SIAM Summer Seminar on Mathematics of Numerical Analysis, Park City, Utah, 1995, Renegar, J.Shub, M.Smale, S. 1996, American Mathematical Society Press, Providence, RI, 189, 210

Chardin, 1995, Multivariate subresultants, J. Pure Appl. Algebra., 101, 129, 10.1016/0022-4049(95)90926-C

Chistov, 1986, Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time, J. Sov. Math., 34, 1838, 10.1007/BF01095643

Dixon, 1908, The eliminant of three quantics in two independent variables, Proc. Lond. Math. Soc., 6, 49

Eisenbud, 1994

M. Elkadi, B. Mourrain, 1996

Elkadi, 1999, Algorithms for residues and Lojasiewicz exponents, J. Pure Appl. Algebra

M. Elkadi, B. Mourrain, Proceedings of ISSAC, Dooley, S. 1999b, ACM Press, New York, 9, 16

Gelfand, 1994

Grigoryev, 1986, Factorization of polynomials over finite field and the solution of systems of algebraic equations, J. Sov. Math., 34, 1762, 10.1007/BF01095638

Harris, 1992

Jouanolou, 1991, Le formalisme du résultant, Adv. Math., 90, 117, 10.1016/0001-8708(91)90031-2

D. Kapur, T. Saxena, L. Yang, Proceedings of ISSAC, von zur Gathen, J. 1994, ACM Press, New York, 99, 107

Kunz, 1986

Macaulay, 1902, Some formulae in elimination, Proc. Lond. Math. Soc., 1, 3, 10.1112/plms/s1-35.1.3

Manocha, 1994, Solving systems of polynomial equations, IEEE Comput. Graph. Appl., Special Issue on Solid Modeling, 46, 10.1109/38.267470

Manocha, 1993, Multipolynomial resultant algorithms, J. Symb. Comput., 15, 99, 10.1006/jsco.1993.1009

Mourrain, 1996, Enumeration problems in geometry, robotics and vision, 285

Mourrain, 1998, Computing isolated polynomial roots by matrix methods, J. Symb. Comput., Special Issue on Symbolic-Numeric Algebra for Polynomials, 26, 715

Pedersen, 1993, Product formulas for resultants and Chow forms, Math. Z., 214, 377, 10.1007/BF02572411

Salmon, 1885

Scheja, 1975, Über Spurfunktionen bei vollständigen Durschnitten, J. Reine Angew Mathematik, 278, 174

Shafarevitch, 1974

Sturmfels, 1993, Sparse elimination theory, 264

Sylvester, 1840, A method of determining by mere inspection the derivatives from two equations of any degree, Philo. Magazine, xvi

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

Van der Waerden, 1948