Selection Strategies
<br>
April Goldman, March 31
<br>
<br>


Buchberger's algorithm is a method for computing a Groebner basis for a
polynomial Ideal.  Groebner bases provide a means for resolving the ideal
membership problem, solving systems of polynomial equations in several
variables, and finding the implicit form of parametric equations.  Being
able to compute a Groebner basis is quite useful; however, Buchberger's
algorithm is highly inefficient.  In my presentation, I will discuss a more
efficient version of Buchberge's algorithm along with selection strategies
for this algorithm that further increase it's efficiency.