Articoli correlati a Permutation Group Algorithms
Sinossi
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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Recensione
'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
Descrizione del libro
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.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
- EditoreCambridge University Press
- Data di pubblicazione2003
- ISBN 10 052166103X
- ISBN 13 9780521661034
- RilegaturaCopertina rigida
- LinguaInglese
- Numero di pagine274
Compra nuovo
Visualizza questo articolo
EUR 136,87
EUR 3,53 per la spedizione in U.S.A.
Destinazione, tempi e costiRisultati della ricerca per Permutation Group Algorithms
Immagini fornite dal venditore
Permutation group algorithms.
Da: Emile Kerssemakers ILAB, Heerlen, Paesi Bassi
Valutazione del venditore 5 su 5 stelle
23 cm. original cloth. 264 pp. bibliography. index. "Cambridge Tracts in Mathematics". -(libr label, library stamps, otherwise (very) good). 525g. Codice articolo 72851
Quantità: 1 disponibili
Foto dell'editore
Permutation Group Algorithms (Cambridge Tracts in Mathematics, Series Number 152)
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo ABLIING23Feb2416190011309
Quantità: Più di 20 disponibili
Foto dell'editore
Permutation Group Algorithms (Cambridge Tracts in Mathematics, Series Number 152)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. In. Codice articolo ria9780521661034_new
Quantità: Più di 20 disponibili
Foto dell'editore
Permutation Group Algorithms (Cambridge Tracts in Mathematics, Series Number 152)
Da: California Books, Miami, FL, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo I-9780521661034
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Permutation Group Algorithms
Print on DemandDa: moluna, Greven, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: 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. Codice articolo 446944146
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Permutation Group Algorithms
Da: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Buch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - Theory of permutation group algorithms for graduates and above. Exercises and hints for implementation throughout. Codice articolo 9780521661034
Quantità: 1 disponibili
Foto dell'editore
Permutation Group Algorithms
Print on DemandDa: THE SAINT BOOKSTORE, Southport, Regno Unito
Valutazione del venditore 5 su 5 stelle
Hardback. Condizione: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 559. Codice articolo C9780521661034
Quantità: Più di 20 disponibili
Foto dell'editore
Permutation Group Algorithms (Hardcover)
Editore:
Cambridge University Press, Cambridge, 2003
ISBN 10: 052166103X
ISBN 13: 9780521661034
Nuovo
Rilegato
Prima edizione
Da: Grand Eagle Retail, Fairfield, OH, U.S.A.
Valutazione del venditore 5 su 5 stelle
Hardcover. Condizione: 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. Codice articolo 9780521661034
Quantità: 1 disponibili
Foto dell'editore
Permutation Group Algorithms
Print on DemandDa: Revaluation Books, Exeter, Regno Unito
Valutazione del venditore 5 su 5 stelle
Hardcover. Condizione: Brand New. 1st edition. 300 pages. 9.25x6.25x1.00 inches. In Stock. This item is printed on demand. Codice articolo __052166103X
Quantità: 1 disponibili
Foto dell'editore
Permutation Group Algorithms (Hardcover)
Editore:
Cambridge University Press, Cambridge, 2003
ISBN 10: 052166103X
ISBN 13: 9780521661034
Nuovo
Rilegato
Prima edizione
Da: CitiRetail, Stevenage, Regno Unito
Valutazione del venditore 5 su 5 stelle
Hardcover. Condizione: 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. Codice articolo 9780521661034
Quantità: 1 disponibili