Symbolic Rewriting Techniques
Symbolic rewriting techniques are methods for deriving consequences from systems of equations, and are of great use when investigating the structure of the solutions. Such techniques appear in many important areas of research within computer algebra: • the Knuth-Bendix completion for groups, monoids...
| Other Authors: | , , |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
Basel
Birkhäuser
1998, 1998
|
| Edition: | 1st ed. 1998 |
| Series: | Progress in Computer Science and Applied Logic
|
| Subjects: | |
| Online Access: | |
| Collection: | Springer Book Archives -2004 - Collection details see MPG.ReNa |
Table of Contents:
- Parallel Completion Techniques
- The Computation of Gröbner Bases Using an Alternative Algorithm
- Symmetrization Based Completion
- On the Reduction of G-invariant Polynomials for an Arbitrary Permutation Groups G
- The Non-Commutaive Gröbner Freaks
- Alternatives in Implementing Noncommutative Gröbner Basis Systems
- String Rewriting and Gröbner Bases — A General Approach to Monoid and Group Rings
- Gröbner Fans and Projective Schemes
- Normalized Rewriting: A Unified View of Knuth-Bendix Completion and Gröbner Bases Computation
- New Directions for Syntactic Termination Orderings
- Two-sided Gröbner Bases in Iterated Ore Extensions
- Computing the Torsion Group of Elliptic Curves by the Method of Gröbner Bases
- Finding a Finite Group presentation Using Rewriting
- Deciding Degree-Four-Identities for Alternative Rings by Rewriting