The origins of computation group theory (CGT) date back to the late 19th and early 20th centuries. Since then, the field has flourished, particularly during the past 30 to 40 years, and today it remains a lively and active branch of mathematics.
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 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.
Throughout the book, applications of all the key topics and algorithms to areas both within and outside of mathematics demonstrate how CGT fits into the wider world of mathematics and science. The authors include detailed pseudocode for all of the fundamental algorithms, and provide detailed worked examples that bring the theorems and algorithms to life.
"This is a book I am very happy to have, both for the choice of content and the quality of exposition. Its subject is a very complete and up-to-date review of computational group theory. …All together, the book contains of a huge amount of information. …I think every mathematician will want this book on his shelf."
-Mathematics of Computation
"It will be an indispensable source for any user in this field."
– G. Kowol, in Monatshefte fur Math, 2007, Vol. 151, No. 3