Home | Quick Search | Advanced Search | Bibliography submission | Bibliography submission using bibtex | Bibliography submission using bibtex file | Links | Help | Internal

Details:

   
TitleCanonical reduction systems in symbolic mathematics.
Author(s) Franz Winkler
TypeBook, Chapter in Book, Conference Proceeding
AbstractMany 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 Knuth-Bendix procedure for equational theories. We explain the basic concept of a canonical reduction system and investigate the close connections between these algorithms.
ISBN978-3-642-03563-0/pbk
URL http://link.springer.com/chapter/10.1007%2F978-3-642-03564-7_7
LanguageEnglish
Pages123--135
PublisherBerlin: Springer
Year2009
Edition0
Translation No
Refereed No
Webmaster