Kontakt
Kako kupovati
Dostava
Savjetnik za kupnju
Permutation Group Algorithms
Engleski
385 b
30 dana za povrat kupljenih proizvoda
Kupci su kupili i
/
Meki uvez
16.16
€
/
Meki uvez
42.84
€
/
Meki uvez
36.27
€
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.
Informacije o knjizi
Engleski
Poklonite ovu knjigu još danas
To je jednostavno
1 Dodajte knjigu u košaricu i odaberite isporuku kao poklon 2 Zauzvrat ćemo vam poslati kupon 3 Knjiga dolazi na adresu poklonoprimcaMoglo bi vas zanimati i
/
Tvrdi uvez
51.02
€
/
Meki uvez
34.45
€
/
Tvrdi uvez
79.62
€
/
Meki uvez
338.82
€
