Kontakt
Jak nakupovat
Doručení
Nákupní rádce
Permutation Group Algorithms
Angličtina
367 b
30 dní na vrácení zboží
Zákazníci také koupili
/
Brožovaná
369
Kč
/
Brožovaná
976
Kč
/
Brožovaná
836
Kč
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, 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. 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.
Informace o knize
Angličtina
Darujte tuto knihu ještě dnes
Je to snadné
1 Přidejte knihu do košíku a zvolte doručit jako dárek 2 Obratem vám zašleme poukaz 3 Kniha dorazí na adresu obdarovanéhoMohlo by vás také zajímat
/
Pevná
1 306
Kč
/
Brožovaná
794
Kč
/
Pevná
1 828
Kč
/
Brožovaná
7 763
Kč
