Handbook of Computational Group Theory
Regular price
€63.99
14 days return policy
Shipping & Delivery
A01=Bettina Eick
A01=Derek F. Holt
A01=Derrick F. Holt
A01=Eamonn A. O'Brien
A7
AA
advanced group theory algorithms
Author_Bettina Eick
Author_Derek F. Holt
Author_Derrick F. Holt
Author_Eamonn A. O'Brien
Automatic Groups
BB
Category=PBF
Category=PBG
Category=UB
Category=UMB
Category=UY
cayley
class
Computational Group Theory
conjugacy
Db
E4
eq_bestseller
eq_computing
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
eq_non-fiction
finite
finite group algorithms
finitely
G C
group cohomology applications
Knuth-Bendix process
matrix group computation
nilpotent group techniques
normal
permutation
permutation group methods
presented
simple
subgroup
T2
Product details
- ISBN 9780367659448
- Weight: 820g
- Dimensions: 156 x 234mm
- Publication Date: 30 Sep 2020
- Publisher: Taylor & Francis Ltd
- Publication City/Country: GB
- Product Form: Paperback
Secure
checkout
Fast Shipping
Easy returns
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.
Derek F. Holt, Bettina Eick, Eamonn A. O'Brien
