Cargando…
Permutation group algorithms /
"The central theme is the description of nearly linear-time algorithms, which are extremely fast in terms of both asymptotic analysis and practical running time. A significant part of the permutation group library of the computational group algebra system GAP is based on nearly linear-time algo...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
New York :
Cambridge University Press,
2003.
|
| Colección: | Cambridge tracts in mathematics ;
152. |
| Temas: | |
| Acceso en línea: | Texto completo |
| Sumario: | "The central theme is the description of nearly linear-time algorithms, which are extremely fast in terms of both asymptotic analysis and 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."--Jacket |
|---|---|
| Descripción Física: | 1 online resource (ix, 264 pages) |
| Bibliografía: | Includes bibliographical references (pages 254-261) and index. |
| ISBN: | 052166103X 9780521661034 0511066473 9780511066474 |