An improved algorithmic construction of Gröbner-bases for polynomial ideals
- 1 May 1978
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGSAM Bulletin
- Vol. 12 (2), 27-36
- https://doi.org/10.1145/1088261.1088267
Abstract
In /1/, /2/ we gave an algorithm for the construction of so called Gröbner-bases of polynomial ideals. In this paper we present some new theoretical results by which the complexity of this algorithm may drastically be reduced in many cases.Keywords
This publication has 2 references indexed in Scilit:
- A theoretical basis for the reduction of polynomials to canonical formsACM SIGSAM Bulletin, 1976
- Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen GleichungssystemsAequationes mathematicae, 1970