Permutation Group Algorithms
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, including 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 t…
Mehr
CHF 143.20
Preise inkl. MwSt. und Versandkosten (Portofrei ab CHF 40.00)
Versandkostenfrei
Produktdetails
- ISBN: 978-0-511-06016-8
- EAN: 9780511060168
- Produktnummer: 13816153
- Verlag: Cambridge University Press
- Sprache: Englisch
- Erscheinungsjahr: 2003
- Seitenangabe: 0 S.
- Plattform: PDF
- Masse: 1'828 KB
7 weitere Werke von Akos Seress:
Bewertungen
Anmelden