Der Artikel ist weiterhin als ^^OTHERCONDITION^^ verfügbar.
Autor: Akos Seress
ISBN-13: 9780511060168
Einband: PDF
Seiten: 0
Sprache: Englisch
eBook Typ: PDF
eBook Format: PDF
Kopierschutz: Adobe DRM [Hard-DRM]
Systemvoraussetzungen
Der Artikel wird am Ende des Bestellprozesses zum Download zur Verfügung gestellt.

Permutation Group Algorithms

Cambridge Tracts in Mathematics
Geben Sie Ihre Bewertung ab!  
Wir verlosen jeden Monat unter allen freigegebenen Rezensionen
3 Gutscheine im Wert von 20 Euro. Teilnahmebedingungen
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 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.
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 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.

Zu diesem Artikel ist noch keine Rezension vorhanden.
Helfen sie anderen Besuchern und verfassen Sie selbst eine Rezension.

 

Rezensionen

Autor: Akos Seress
ISBN-13 :: 9780511060168
ISBN: 0511060165
Verlag: Cambridge University Press
Sprache: Englisch
Sonstiges: Ebook, Maximale Downloadanzahl: 6