- We will send in 10–14 business days.
/images/books/13019138/9783110167214.jpg)
- Publisher: De Gruyter
- ISBN-10: 3110167212
- ISBN-13: 9783110167214
- Format: 17 x 24.4 x 2.2 cm, hardcover
- Language: English
- SAVE -10% with code: EXTRA
Groups and Computation III (e-book) (used book) | bookbook.eu
Reviews
Description
This volume contains contributions by the participants of the conference Groups and Computation, which took place at The Ohio State University in Columbus, Ohio, in June 1999. This conference was the successor of two workshops on Groups and Computation held at DIMACS in 1991 and 1995.
There are papers on permutation group algorithms, finitely presented groups, polycyclic groups, and parallel computation, providing a representative sample of the breadth of Computational Group Theory. On the other hand, more than one third of the papers deal with computations in matrix groups, giving an in-depth treatment of the currently most active area of the field.
The points of view of the papers range from explicit computations to group-theoretic algorithms to group-theoretic theorems needed for algorithm development.
EXTRA 10 % discount with code: EXTRA
The promotion ends in 16d.05:30:52
The discount code is valid when purchasing from 10 €. Discounts do not stack.
- Publisher: De Gruyter
- ISBN-10: 3110167212
- ISBN-13: 9783110167214
- Format: 17 x 24.4 x 2.2 cm, hardcover
- Language: English English
This volume contains contributions by the participants of the conference Groups and Computation, which took place at The Ohio State University in Columbus, Ohio, in June 1999. This conference was the successor of two workshops on Groups and Computation held at DIMACS in 1991 and 1995.
There are papers on permutation group algorithms, finitely presented groups, polycyclic groups, and parallel computation, providing a representative sample of the breadth of Computational Group Theory. On the other hand, more than one third of the papers deal with computations in matrix groups, giving an in-depth treatment of the currently most active area of the field.
The points of view of the papers range from explicit computations to group-theoretic algorithms to group-theoretic theorems needed for algorithm development.
Reviews