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 |
Tabla de Contenidos:
- Introduction
- Black-box groups
- Permutation groups: a complexity overview
- Bases and strong generating sets
- Further low-level algorithms
- A library of nearly linear-time algorithms
- Solvable permutation groups
- Strong generating tests
- Backtrack methods
- Large-base groups.