Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Permutation Group Algorithms

Permutation Group Algorithms

Seress, Akos
Bollobas, Bela
Seress, Kos

Hardcover

Series: Cambridge Tracts in Mathematics, Book 152

Medical ReferenceAlgebraGeneral Mathematics

ISBN10: 052166103X
ISBN13: 9780521661034
Publisher: Cambridge University Press
Published: Mar 17 2003
Pages: 274
Weight: 1.14
Height: 0.90 Width: 6.20 Depth: 9.10
Language: English
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.

Also from

Seress, Akos

View All

Also in

General Mathematics

View All