TY  - GEN
T1  - Permutation group algorithms
T2  - Cambridge tracts in mathematics ;
A1  - Seress, Ákos, 1958-
LA  - English
PP  - New York
PB  - Cambridge University Press
YR  - 2003
UL  - https://ebooks.jgu.edu.in/Record/ebsco_acadsubs_ocm70746506
AB  - "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
OP  - 264
CN  - QA175 .S47 2003eb
SN  - 052166103X
SN  - 9780521661034
SN  - 0511066473
SN  - 9780511066474
KW  - Permutation groups.
KW  - Algorithms.
KW  - Algorithms
KW  - Groupes de permutations.
KW  - Algorithmes.
KW  - algorithms.
KW  - MATHEMATICS : Group Theory.
KW  - Permutation groups
KW  - Electronic books.
ER  -