Connection to modern theories
The linear case would now routinely be handled by Gaussian elimination, rather than the theoretical solution provided by Cramer's rule. In the same way, computational techniques for elimination can in practice be based on Gröbner basis methods. There is however older literature on types of eliminant, including resultants to find common roots of polynomials, discriminants and so on. In particular the discriminant appears in invariant theory, and is often constructed as the invariant of either a curve or an n-ary k-ic form. Whilst discriminants are always constructed resultants, the variety of constructions and their meaning tends to vary. A modern and systematic version of theory of the discriminant has been developed by Gelfand and coworkers. Some of the systematic methods have a homological basis, that can be made explicit, as in Hilbert's theorem on syzygies. This field is at least as old as Bézout's theorem.
The historical development of commutative algebra, which was initially called ideal theory, is closely linked to concepts in elimination theory: ideas of Kronecker, who wrote a major paper on the subject, were adapted by Hilbert and effectively 'linearised' while dropping the explicit constructive content. The process continued over many decades: the work of F.S. Macaulay, who gave his name to Cohen–Macaulay modules, was motivated by elimination.
Connection with logic
There is also a logical content to elimination theory, as seen in the Boolean satisfiability problem. In the worst case it is presumably hard to eliminate variables computationally. "Quantifier elimination" is a term used in mathematical logic to explain that, in some theories, every formula is equivalent with a formula without quantifier. This is the case of the theory of the polynomials over an algebraically closed field, and "elimination theory" may be viewed as the theory of the methods making quantifier elimination effective (algorithmic) in this case. Quantifier elimination over the reals is another example, which is fundamental in computational algebraic geometry.
- Israel Gelfand, Mikhail Kapranov, Andrey Zelevinsky, Discriminants, resultants, and multidimensional determinants. Mathematics: Theory & Applications. Birkhäuser Boston, Inc., Boston, MA, 1994. x+523 pp. ISBN 0-8176-3660-9
- Lang, Serge (2002), Algebra, Graduate Texts in Mathematics, 211 (Revised third ed.), New York: Springer-Verlag, ISBN 978-0-387-95385-4, MR 1878556
- David Cox, John Little, Donal O'Shea, Using Algebraic Geometry. Revised second edition. Graduate Texts in Mathematics, vol. 185. Springer-Verlag, 2005, xii+558 pp., ISBN 978-0-387-20733-9