
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...

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...