Details:
Title  Canonical reduction systems in symbolic mathematics.  Author(s)  Franz Winkler  Type  Book, Chapter in Book, Conference Proceeding  Abstract  Many algorithmic methods in mathematics can be seen as constructing canonical reduction systems for deciding membership problems. Important examples are the Gauss elimination method for linear systems, Euclid’s algorithm for computing greatest common divisors, Buchberger’s algorithm for constructing Gröbner bases, or the KnuthBendix procedure for equational theories. We explain the basic concept of a canonical reduction system and investigate the close connections between these algorithms.  ISBN  9783642035630/pbk 
URL 
http://link.springer.com/chapter/10.1007%2F9783642035647_7 
Language  English  Pages  123135  Publisher  Berlin: Springer  Year  2009  Edition  0  Translation 
No  Refereed 
No 
