| Description |
xvi, 514 pages ; 25 cm |
| Series |
Discrete mathematics and its applications |
|
Discrete mathematics and its applications.
|
| Contents |
1. A historical review of computational group theory -- 2. Background material -- 3. Representing groups on a computer -- 4. Computation in finite permutation groups -- 5. Coset enumeration -- 6. Presentations of given groups -- 7. Representation theory, cohomology, and characters -- 8. Computation with polycyclic groups -- 9. Computing quotients of finitely presented groups -- 10. Advanced computations in finite groups -- 11. Libraries and databases -- 12. Rewriting systems and the Knuth-Bendix completion process -- 13. Finite state automata and automatic groups |
| Summary |
"The Handbook of Computational Group Theory offers the first complete treatment of all the fundamental methods and algorithms in CGT presented at a level accessible even to advanced undergraduate students. It develops the theory of algorithms in full detail and highlights the connections between the different aspects of CGT and with other areas of computer algebra. While acknowledging the importance of the complexity analysis of CGT algorithms, the authors primary focus is on algorithms that perform well in practice rather than on those with the best theoretical complexity."--BOOK JACKET |
| Notes |
Eamonn A. O'Brien is a lecturer at University of Auckland, N.Z |
| Bibliography |
Includes bibliographical references (pages 471-496) and indexes |
| Subject |
Group theory -- Data processing.
|
|
Finite groups -- Data processing.
|
|
Combinatorial group theory -- Data processing.
|
| Author |
Eick, Bettina.
|
|
O'Brien, Eamonn A.
|
| LC no. |
2004043146 |
| ISBN |
1584883723 hardback |
|
