Cantitate/Preț
Produs

Symbolic Rewriting Techniques: Progress in Computer Science and Applied Logic, cartea 15

Editat de Manuel Bronstein, Johannes Grabmeier, Volker Weispfenning
en Limba Engleză Paperback – 23 oct 2012
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.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 31715 lei  6-8 săpt.
  Birkhäuser Basel – 23 oct 2012 31715 lei  6-8 săpt.
Hardback (1) 55669 lei  6-8 săpt.
  Birkhauser – 23 mar 1998 55669 lei  6-8 săpt.

Din seria Progress in Computer Science and Applied Logic

Preț: 31715 lei

Preț vechi: 39644 lei
-20% Nou

Puncte Express: 476

Preț estimativ în valută:
6072 6579$ 5070£

Carte tipărită la comandă

Livrare economică 12-26 decembrie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783034897792
ISBN-10: 3034897790
Pagini: 300
Ilustrații: VII, 288 p.
Dimensiuni: 170 x 244 x 16 mm
Greutate: 0.48 kg
Ediția:Softcover reprint of the original 1st ed. 1998
Editura: Birkhäuser Basel
Colecția Birkhäuser
Seria Progress in Computer Science and Applied Logic

Locul publicării:Basel, Switzerland

Public țintă

Research

Cuprins

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.

Recenzii

"14 contributions can be found within 288 pages, each of them with an extended reference list... Of high value to people who have some experience in this subject matter."
--The DERIVE Newsletter