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...
| المؤلف الرئيسي: | |
|---|---|
| التنسيق: | Licensed eBooks |
| اللغة: | الإنجليزية |
| منشور في: |
New York :
Cambridge University Press,
2003.
|
| سلاسل: | Cambridge tracts in mathematics ;
152. |
| الوصول للمادة أونلاين: | https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=120693 |
| الملخص: | "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 |
|---|---|
| وصف مادي: | 1 online resource (ix, 264 pages) |
| بيبلوغرافيا: | Includes bibliographical references (pages 254-261) and index. |
| ردمك: | 052166103X 9780521661034 0511066473 9780511066474 |