Skip to main content
Conference Proceedings

Gröbner bases: An introduction

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1992) 623 LNCS 378-379
DOI: 10.1007/3-540-55719-9_89
2Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Gröbner bases form a core topic of computer algebra and are needed for various subsequent chapters of this book. There are several ways of looking at the famous Buchberger algorithm for constructing Gröbner bases. In this section, we give three interpretations. In the following sections, the Buchberger algorithm and its role according to each interpretation will be discussed in detail.

Cite

CITATION STYLE

APA

Buchberger, B. (1992). Gröbner bases: An introduction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 623 LNCS, pp. 378–379). Springer Verlag. https://doi.org/10.1007/3-540-55719-9_89

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