Permutation Group Algorithms
Language: English
Published by Cambridge University Press, 2013
- Softcover
- New

Condition: New
US$ 218.08
Quantity: 2 available
Add to basketItem description from seller
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. Sprache: Englisch Gewicht in Gramm: 552. …
Seller Inventory # IB-3161090
- Title
- Permutation Group Algorithms
- Author
- Akos Seress, Kos Seress
- Publisher
- Cambridge University Press
- Publication year
- 2013
- Condition
- Neu
- Binding
- Gebundene Ausgabe
- Language
- English
- ISBN 10
- 052166103X
- ISBN 13
- 9780521661034
- Item weight
- 552 grams
"Synopsis" may belong to another edition of this title.
Book Description
"About the title" may belong to another edition of this title.
Shipping rates from Germany to U.S.A.
| Item | 10 to 12 business days | 8 to 10 business days |
|---|---|---|
| First item | US$ 54.88 | US$ 82.49 |
Payment methods
- Check