About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
SYMSAC 1981
Conference paper
On solving systems of algebraic equations via ideal bases and elimination theory
Abstract
The determination of solutions of a system of algebraic equations is still a problem for which an efficient solution does not exist. In the last few years several authors have suggested new or refined methods, but none of them seems to be satisfactory. In this paper we are mainly concerned with exploring the use of Buchberger's algorithm for finding Groebner ideal bases [2] and combine/compare it with the more familiar methods of polynomial remainder sequences (pseudo-division) and of variable elimination (resultants) [4].