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 |