資料來源: Google Book
Permutation group algorithms
- 作者: Seress, Ákos,
- 出版: New York : Cambridge University Press 2003.
- 稽核項: 1 online resource (ix, 264 pages).
- 叢書名: Cambridge tracts in mathematics ;152
- 標題: Algorithmes. , Group Theory. , Permutation groups. , MATHEMATICS Group Theory. , Groupes de permutations. , Algorithms , Electronic books. , MATHEMATICS , Algorithms. , algorithms.
- ISBN: 0511066473 , 9780511066474
- 試查全文@TNUA:
- 附註: Includes bibliographical references (pages 254-261) and index. 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.
- 摘要: "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.
- 電子資源: https://dbs.tnua.edu.tw/login?url=https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=120693
- 系統號: 005320646
- 資料類型: 電子書
- 讀者標籤: 需登入
- 引用網址: 複製連結
Permutation group algorithms were instrumental in the proof of many deep results. This book describes the theory, up to the most recent developments, and includes hints for implementation and advanced exercises. It is recommended for everyone interested in using computers in group theory, and is suitable for advanced graduate courses.
來源: Google Book
來源: Google Book
評分