Articles liés à Permutation Group Algorithms
Présentation de l'éditeur
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.
Revue de presse
'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
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
- ÉditeurCambridge University Press
- Date d'édition2003
- ISBN 10 052166103X
- ISBN 13 9780521661034
- ReliureRelié
- Langueanglais
- Nombre de pages274
Acheter neuf
Afficher cet article
EUR 136,87
EUR 3,53 expédition vers Etats-Unis
Destinations, frais et délaisRésultats de recherche pour Permutation Group Algorithms
Image fournie par le vendeur
Permutation group algorithms.
Edité par
UP, Cambridge, 2003
ISBN 10 : 052166103X
ISBN 13 : 9780521661034
Ancien ou d'occasion
Couverture rigide
Vendeur : Emile Kerssemakers ILAB, Heerlen, Pays-Bas
Évaluation du vendeur 5 sur 5 étoiles
23 cm. original cloth. 264 pp. bibliography. index. "Cambridge Tracts in Mathematics". -(libr label, library stamps, otherwise (very) good). 525g. N° de réf. du vendeur 72851
Quantité disponible : 1 disponible(s)
Image d'archives
Permutation Group Algorithms (Cambridge Tracts in Mathematics, Series Number 152)
Edité par
Cambridge University Press, 2003
ISBN 10 : 052166103X
ISBN 13 : 9780521661034
Neuf
Couverture rigide
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur ABLIING23Feb2416190011309
Quantité disponible : Plus de 20 disponibles
Image d'archives
Permutation Group Algorithms (Cambridge Tracts in Mathematics, Series Number 152)
Edité par
Cambridge University Press, 2003
ISBN 10 : 052166103X
ISBN 13 : 9780521661034
Neuf
Couverture rigide
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9780521661034_new
Quantité disponible : Plus de 20 disponibles
Image d'archives
Permutation Group Algorithms (Cambridge Tracts in Mathematics, Series Number 152)
Edité par
Cambridge University Press, 2003
ISBN 10 : 052166103X
ISBN 13 : 9780521661034
Neuf
Couverture rigide
Vendeur : California Books, Miami, FL, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. N° de réf. du vendeur I-9780521661034
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Permutation Group Algorithms
Edité par
Cambridge University Press, 2013
ISBN 10 : 052166103X
ISBN 13 : 9780521661034
Neuf
Couverture rigide
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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. N° de réf. du vendeur 446944146
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Permutation Group Algorithms
Edité par
Cambridge University Press, 2003
ISBN 10 : 052166103X
ISBN 13 : 9780521661034
Neuf
Couverture rigide
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Buch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - Theory of permutation group algorithms for graduates and above. Exercises and hints for implementation throughout. N° de réf. du vendeur 9780521661034
Quantité disponible : 1 disponible(s)
Image d'archives
Permutation Group Algorithms
Edité par
Cambridge University Press, 2003
ISBN 10 : 052166103X
ISBN 13 : 9780521661034
Neuf
Couverture rigide
Vendeur : THE SAINT BOOKSTORE, Southport, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Hardback. Etat : New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 559. N° de réf. du vendeur C9780521661034
Quantité disponible : Plus de 20 disponibles
Image d'archives
Permutation Group Algorithms (Hardcover)
Edité par
Cambridge University Press, Cambridge, 2003
ISBN 10 : 052166103X
ISBN 13 : 9780521661034
Neuf
Couverture rigide
Edition originale
Vendeur : Grand Eagle Retail, Fairfield, OH, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Hardcover. Etat : new. Hardcover. 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. 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. N° de réf. du vendeur 9780521661034
Quantité disponible : 1 disponible(s)
Image d'archives
Permutation Group Algorithms
Edité par
Cambridge Univ Pr, 2003
ISBN 10 : 052166103X
ISBN 13 : 9780521661034
Neuf
Couverture rigide
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Hardcover. Etat : Brand New. 1st edition. 300 pages. 9.25x6.25x1.00 inches. In Stock. This item is printed on demand. N° de réf. du vendeur __052166103X
Quantité disponible : 1 disponible(s)
Image d'archives
Permutation Group Algorithms (Hardcover)
Edité par
Cambridge University Press, Cambridge, 2003
ISBN 10 : 052166103X
ISBN 13 : 9780521661034
Neuf
Couverture rigide
Edition originale
Vendeur : CitiRetail, Stevenage, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Hardcover. Etat : new. Hardcover. 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. 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. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. N° de réf. du vendeur 9780521661034
Quantité disponible : 1 disponible(s)