=ADD=
=author=
Windsteiger; Wolfgang + Buchberger; Bruno
=title=
GR\"OBNER: A Library for Computing Gr\"obner Bases based on SACLIB
=number=
93-72
=year=
1993
=sponsor=
Austrian Ministery of Science, proj. no. 613.523/3-27a/89  (``Gr"{o}bner Bases''), POSSO project (Polynomial System Solving), Esprit III Basic Research Action 6846,  supported by the Austrian Science Foundation.

=url=
ftp://ftp.risc.uni-linz.ac.at/pub/techreports/1993/93-72.ps.gz
=abstract=
Almost every computer algebra system contains some
implementation of the Gr\"obner bases algorithm. The
present implementation has the following specific
features:

The source code is distributed and publically available
free of charge.

The library is written in C.

A simple but efficient mechanism of polymorphism is
implemented that enables the user to adjust the library
to a wide variety of coefficient domains, power product
and polynomial representations, admissible orderings,
selection strategies for pairs, etc.

Thus, GR\"OBNER should be a useful tool

for those who want to do research in Gr\"obner bases
theory and applications and, hence, need access to all
details of the implementation 

and also for those who want to apply the algorithm as a
black box, possibly as a subalgorithm in a larger
implementation, and need high efficiency.

=location=
2
=owner=
2
=source=
3
=reftype=
14