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...
| Cote: | Libro Electrónico |
|---|---|
| Auteur principal: | |
| Format: | Électronique eBook |
| Langue: | Inglés |
| Publié: |
New York :
Cambridge University Press,
2003.
|
| Collection: | Cambridge tracts in mathematics ;
152. |
| Sujets: | |
| Accès en ligne: | Texto completo |


