Artículos relacionados a Permutation Group Algorithms: 152 (Cambridge Tracts...
Sinopsis
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.
"Sinopsis" puede pertenecer a otra edición de este libro.
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
- EditorialCambridge University Press
- Año de publicación2003
- ISBN 10 052166103X
- ISBN 13 9780521661034
- EncuadernaciónTapa dura
- IdiomaInglés
- Número de páginas274
EUR 70,00
EUR 26,00 gastos de envío desde Holanda a Estados Unidos de America
Destinos, gastos y plazos de envíoComprar nuevo
Ver este artículo
EUR 136,87
EUR 3,53 gastos de envío en Estados Unidos de America
Destinos, gastos y plazos de envíoResultados de la búsqueda para Permutation Group Algorithms: 152 (Cambridge Tracts...
Imagen del vendedor
Permutation group algorithms.
Publicado por
UP, Cambridge, 2003
ISBN 10: 052166103X
ISBN 13: 9780521661034
Antiguo o usado
Tapa dura
Librería: Emile Kerssemakers ILAB, Heerlen, Holanda
Calificación del vendedor: 5 de 5 estrellas
23 cm. original cloth. 264 pp. bibliography. index. "Cambridge Tracts in Mathematics". -(libr label, library stamps, otherwise (very) good). 525g. Nº de ref. del artículo: 72851
Gastos de envío:
EUR 26,00
De Holanda a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: 1 disponibles
Imagen de archivo
Permutation Group Algorithms (Cambridge Tracts in Mathematics, Series Number 152)
Publicado por
Cambridge University Press, 2003
ISBN 10: 052166103X
ISBN 13: 9780521661034
Nuevo
Tapa dura
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: ABLIING23Feb2416190011309
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Permutation Group Algorithms (Cambridge Tracts in Mathematics, Series Number 152)
Publicado por
Cambridge University Press, 2003
ISBN 10: 052166103X
ISBN 13: 9780521661034
Nuevo
Tapa dura
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Condición: New. In. Nº de ref. del artículo: ria9780521661034_new
Gastos de envío:
EUR 14,07
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Permutation Group Algorithms (Cambridge Tracts in Mathematics, Series Number 152)
Publicado por
Cambridge University Press, 2003
ISBN 10: 052166103X
ISBN 13: 9780521661034
Nuevo
Tapa dura
Librería: California Books, Miami, FL, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: I-9780521661034
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Permutation Group Algorithms
Publicado por
Cambridge University Press, 2013
ISBN 10: 052166103X
ISBN 13: 9780521661034
Nuevo
Tapa dura
Librería: moluna, Greven, Alemania
Calificación del vendedor: 5 de 5 estrellas
Condición: 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 ref. del artículo: 446944146
Gastos de envío:
EUR 48,99
De Alemania a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Permutation Group Algorithms
Publicado por
Cambridge University Press, 2003
ISBN 10: 052166103X
ISBN 13: 9780521661034
Nuevo
Tapa dura
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
Buch. Condición: 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 ref. del artículo: 9780521661034
Gastos de envío:
EUR 30,99
De Alemania a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: 1 disponibles
Imagen de archivo
Permutation Group Algorithms
Publicado por
Cambridge University Press, 2003
ISBN 10: 052166103X
ISBN 13: 9780521661034
Nuevo
Tapa dura
Librería: THE SAINT BOOKSTORE, Southport, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Hardback. Condición: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 559. Nº de ref. del artículo: C9780521661034
Gastos de envío:
EUR 14,50
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Permutation Group Algorithms (Hardcover)
Publicado por
Cambridge University Press, Cambridge, 2003
ISBN 10: 052166103X
ISBN 13: 9780521661034
Nuevo
Tapa dura
Original o primera edición
Librería: Grand Eagle Retail, Fairfield, OH, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Hardcover. Condición: 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 ref. del artículo: 9780521661034
Cantidad disponible: 1 disponibles
Imagen de archivo
Permutation Group Algorithms
Impresión bajo demandaLibrería: Revaluation Books, Exeter, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Hardcover. Condición: Brand New. 1st edition. 300 pages. 9.25x6.25x1.00 inches. In Stock. This item is printed on demand. Nº de ref. del artículo: __052166103X
Gastos de envío:
EUR 11,75
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: 1 disponibles
Imagen de archivo
Permutation Group Algorithms (Hardcover)
Publicado por
Cambridge University Press, Cambridge, 2003
ISBN 10: 052166103X
ISBN 13: 9780521661034
Nuevo
Tapa dura
Original o primera edición
Librería: CitiRetail, Stevenage, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Hardcover. Condición: 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 ref. del artículo: 9780521661034
Gastos de envío:
EUR 43,47
De Reino Unido a Estados Unidos de America
Destinos, gastos y plazos de envío
Cantidad disponible: 1 disponibles