Permutation Group Algorithms

by Ákos Seress

Permutation group algorithms are indispensable in the proofs of many deep results, including the construction and study of sporadic finite simple groups. This work describes the theory behind permutation group algorithms, up to the most recent 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...

• Format: Hardcover
• Language: English
• ISBN: 052166103X
• ISBN13: 9780521661034
• Release Date: March 2003
• Publisher: Cambridge University Press
• Length: 274 Pages
• Weight: 1.14 lbs.
• Dimensions: 0.9" x 6.2" x 9.1"