|
|
|
|
| LEADER |
02933nmm a2200313 u 4500 |
| 001 |
EB000637103 |
| 003 |
EBX01000000000000000490185 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
140122 ||| eng |
| 020 |
|
|
|a 9783034888004
|
| 100 |
1 |
|
|a Bronstein, Manuel
|e [editor]
|
| 245 |
0 |
0 |
|a Symbolic Rewriting Techniques
|h Elektronische Ressource
|c edited by Manuel Bronstein, Johannes Grabmeier, Volker Weispfenning
|
| 250 |
|
|
|a 1st ed. 1998
|
| 260 |
|
|
|a Basel
|b Birkhäuser
|c 1998, 1998
|
| 300 |
|
|
|a VII, 288 p
|b online resource
|
| 505 |
0 |
|
|a 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
|
| 653 |
|
|
|a Computer science
|
| 653 |
|
|
|a Theory of Computation
|
| 653 |
|
|
|a Mathematics
|
| 700 |
1 |
|
|a Grabmeier, Johannes
|e [editor]
|
| 700 |
1 |
|
|a Weispfenning, Volker
|e [editor]
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
| 490 |
0 |
|
|a Progress in Computer Science and Applied Logic
|
| 028 |
5 |
0 |
|a 10.1007/978-3-0348-8800-4
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-3-0348-8800-4?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 004.0151
|
| 520 |
|
|
|a 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 and general term-rewriting systems, • the Buchberger algorithm for Gröbner bases, • the Ritt-Wu characteristic set method for ordinary differential equations, and • the Riquier-Janet method for partial differential equations. This volume contains invited and contributed papers to the Symbolic Rewriting Techniques workshop, which was held at the Centro Stefano Franscini in Ascona, Switzerland, from April 30 to May 4, 1995. That workshop brought together 40 researchers from various areas of rewriting techniques, the main goal being the investigation of common threads and methods. Following the workshops, each contribution was formally refereed and 14 papers were selected for publication
|