Loading…
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...
| Call Number: | Libro Electrónico |
|---|---|
| Main Author: | |
| Format: | Electronic eBook |
| Language: | Inglés |
| Published: |
New York :
Cambridge University Press,
2003.
|
| Series: | Cambridge tracts in mathematics ;
152. |
| Subjects: | |
| Online Access: | Texto completo |