Skip to main content
Conference Proceedings

On improving approximate results of Buchberger's algorithm by Newton's method

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1985) 204 LNCS 608-612
DOI: 10.1007/3-540-15984-3_342
7Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In some applications of Buchberger's algorithm it is possible to avoid the use of multiple precision arithmetics in the main part of the calculations, even if the results are large numbers.

Cite

CITATION STYLE

APA

Trinks, W. (1985). On improving approximate results of Buchberger’s algorithm by Newton’s method. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 204 LNCS, pp. 608–612). Springer Verlag. https://doi.org/10.1007/3-540-15984-3_342

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free