Permutation Group Algorithms
1st edition
Our rough guess is there are 75,000 words in this book.
At a pace averaging 250 words per minute, this book will take 5 hours and 0 minutes to read. With a half hour per day, this will take 10 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
Word Count
75,000 words, Guess
Page Count
300 pages
Physical Format
Hardcover
Identifiers
- ISBN-10052166103X
- ISBN-139780521661034
- Goodreads5959338
- Open LibraryOL7750713M
- Open LibraryOL18141075M
Description
Permutation group algorithms are one of the workhorses of symbolic algebra systems computing with groups. They played an indispensable role in the proof of many deep results, including the construction and study of sporadic finite simple groups. This book describes the theory behind permutation group algorithms, including developments based on the classification of finite simple groups. Rigorous complexity estimates, implementation hints, and advanced exercises are included throughout. The central theme is the description of nearly linear time algorithms, which are extremely fast both in terms of asymptotic analysis and of practical running time. A significant part of the permutation group library of the computational group algebra system GAP is based on nearly linear time algorithms. The book fills a significant gap in the symbolic computation literature. It is recommended for everyone interested in using computers in group theory, and is suitable for advanced graduate courses.
Subjects
Other Editions
- Permutation Group Algorithms
Similar Books
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!