Verwandte Artikel zu Permutation Group Algorithms: 152 (Cambridge Tracts...
Inhaltsangabe
Permutation group algorithms were instrumental in the proof of many deep results. This book describes the theory, and includes hints for implementation and advanced exercises. It is recommended for everyone interested in using computers in group theory, and is suitable for advanced graduate courses.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Críticas
'The book will be an invaluable tool for anyone who is interested in permutation groups, computational group theory or the broader area of computations involving symmetries and deserves a space on the shelf of any researcher in these areas.' Zentralblatt für Mathematik
'... this monograph by Akos Seress, one of the leaders in the field, is a welcome contribution. ... the monograph is welcome not only for giving us an encyclopaedic account of the area, but also for its timeliness. A good author of a good book stamps his or her tastes and expertise firmly on the pages. That is what has happened here. In particular, because it should be of lasting value, it is a very appropriate addition to the Cambridge Tracts.' Peter M. Neumann, The Queen's College, Oxford
Reseña del editor
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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
- VerlagCambridge University Press
- Erscheinungsdatum2003
- ISBN 10 052166103X
- ISBN 13 9780521661034
- EinbandTapa dura
- SpracheEnglisch
- Anzahl der Seiten274
Neu kaufen
Diesen Artikel anzeigen
EUR 128,38
EUR 14,09 für den Versand von Vereinigtes Königreich nach USA
Versandziele, Kosten & DauerSuchergebnisse für Permutation Group Algorithms: 152 (Cambridge Tracts...
Foto des Verkäufers
Permutation group algorithms.
Anbieter: Emile Kerssemakers ILAB, Heerlen, Niederlande
Verkäuferbewertung 5 von 5 Sternen
23 cm. original cloth. 264 pp. bibliography. index. "Cambridge Tracts in Mathematics". -(libr label, library stamps, otherwise (very) good). 525g. Artikel-Nr. 72851
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Permutation Group Algorithms (Cambridge Tracts in Mathematics, Series Number 152)
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. In. Artikel-Nr. ria9780521661034_new
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Permutation Group Algorithms
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Theory of permutation group algorithms for graduates and above. Exercises and hints for implementation throughout. Artikel-Nr. 9780521661034
Anzahl: 1 verfügbar