| 000 | 02479nam a22003618i 4500 | ||
|---|---|---|---|
| 001 | CR9780511546549 | ||
| 003 | UkCbUP | ||
| 005 | 20200124160238.0 | ||
| 006 | m|||||o||d|||||||| | ||
| 007 | cr|||||||||||| | ||
| 008 | 090508s2003||||enk o ||1 0|eng|d | ||
| 020 | _a9780511546549 (ebook) | ||
| 020 | _z9780521661034 (hardback) | ||
| 040 |
_aUkCbUP _beng _erda _cUkCbUP |
||
| 050 | 0 | 0 |
_aQA175 _b.S47 2003 |
| 082 | 0 | 0 |
_a512/.2 _221 |
| 100 | 1 |
_aSeress, Ákos, _d1958- _eauthor. |
|
| 245 | 1 | 0 |
_aPermutation group algorithms / _cÁkos Seress. |
| 264 | 1 |
_aCambridge : _bCambridge University Press, _c2003. |
|
| 300 |
_a1 online resource (ix, 264 pages) : _bdigital, PDF file(s). |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 490 | 1 |
_aCambridge tracts in mathematics ; _v152 |
|
| 500 | _aTitle from publisher's bibliographic system (viewed on 05 Oct 2015). | ||
| 505 | 0 | _aIntroduction -- 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. | |
| 520 | _aPermutation group algorithms are one of the workhorses of symbolic algebra systems computing with groups. They played an indispensable role in the proof of many deep results, including the construction and study of sporadic finite simple groups. This book describes the theory behind permutation group algorithms, including developments based on the classification of finite simple groups. Rigorous complexity estimates, implementation hints, and advanced exercises are included throughout. The central theme is the description of nearly linear time algorithms, which are extremely fast both in terms of asymptotic analysis and of 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. | ||
| 650 | 0 | _aPermutation groups. | |
| 650 | 0 | _aAlgorithms. | |
| 776 | 0 | 8 |
_iPrint version: _z9780521661034 |
| 830 | 0 |
_aCambridge tracts in mathematics ; _v152. |
|
| 856 | 4 | 0 | _uhttps://doi.org/10.1017/CBO9780511546549 |
| 999 |
_c518228 _d518226 |
||