=ADD=
=reftype=
14
=number=
04-04
=url=
ftp://ftp.risc.uni-linz.ac.at/pub/techreports/2004/04-04.ps.gz
=year=
2004
=month=
05
=author=
Roda; Giovanna
=title=
Algorithms for Change of Orderings in the Theory of Gr{\" o}bner Bases
=abstract=
Gr{\" o}bner bases are one of the most significant methods of computer
algebra. Its high computational complexity makes the method often
unfeasible in practice, and several techniques for its improvement
have been investigated. Algorithms for change of orderings reduce
the complexity of lexicographic Gr{\" o}bner bases, that are interesting
for many practical applications. 

This thesis is concerned with an unified treatment of the Gr{\" o}bner
walk and the FGLM algorihms for change of orderings. The relation
between the two algorithms becomes clear in a combination of the two
methods that we call FGLM walk. 

After a thorough description of the algorithms and their mathematical
background, we conclude by comparing their performance on some real
examples.
=note=
PhD Thesis
=sponsor=
RISC
=keywords=
Groebner bases, term orderings, Groebner walk, FGLM