Cargando…
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...
| Autores principales: | , , |
|---|---|
| Lenguaje: | eng |
| Publicado: |
Springer
1998
|
| Materias: | |
| Acceso en línea: | https://dx.doi.org/10.1007/978-3-0348-8800-4 http://cds.cern.ch/record/2006175 |