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 |
সূচিপত্রের সারণি:
- 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.