Title Statements
- Full title :Permutation group algorithms / Ákos Seress.
Summary
"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
Read More ↓Edition Statements
- Publication Date:2003.
Publication Statements
- Publisher(s):Cambridge University Press
- Place of Publication:New York
- Language:eng
- Publication Date:2003.
The Physical Object
- Description:1 online resource (ix, 264 pages)
Edition Identifiers
- ISBN:052166103X, 9780521661034, 0511066473, 9780511066474
- oclc:ocm70746506
- LC Classification:QA175
- Dewey Decimal:512/.2
Table of Contents
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.
Read More ↓Subjects
Writers
More from this Series
No reviews yet. Be the first to rate this work.
Rate & Review