Abstract
In this paper we give an explicit description of an algorithm for finding all solutions of a system of algebraic equations which is solvable and has finitely many solutions. This algorithm is an improved version of a method which was deviced by B. Buchberger. By a theorem proven in this paper, gcd-computations occurring in Buchberger's method can be avoided in our algorithm.
Cite
CITATION STYLE
Kalkbrener, M. (1989). Solving systems of algebraic equations by using gröbner bases. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 378 LNCS, pp. 282–292). Springer Verlag. https://doi.org/10.1007/3-540-51517-8_127
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
