Permutation Group Algorithms - Ákos Seress
Cambridge University Press (2002)
In Collection

Read It:
Algorithms, Group theory, Permutation groups

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 nearly linear time algorithms, which are extremely fast both in terms of asymptotic analysis and of practical running time. The book fills a significant gap in the symbolic computation literature for readers interested in using computers in group theory.

Product Details
LoC Classification QA175 .S47 2003
Dewey 512.2
Format Hardcover
Cover Price 94,00 €
No. of Pages 300
Height x Width 234 x 157 mm