Mendeley出力
＜図書＞
Permutation group algorithms
| 責任表示 | Ákos Seress |
|---|---|
| シリーズ | Cambridge tracts in mathematics ; 152 |
| データ種別 | 図書 |
| 出版情報 | New York, N.Y. : Cambridge University Press , 2003 |
| 本文言語 | 英語 |
| 大きさ | ix, 264 p. ; 24 cm |
| 概要 | Permutation group algorithms are indispensable in the proofs of many deep results, including the construction and study of sporadic finite simple groups. This work describes the theory behind permutat...on group algorithms, up to the most recent 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. The book fills a significant gap in the symbolic computation literature for readers interested in using computers in group theory. 続きを見る |
| 電子版へのリンク | https://hdl.handle.net/2324/6973011 |
所蔵情報
| 状態 | 巻次 | 所蔵場所 | 請求記号 | 刷年 | 文庫名称 | 資料番号 | コメント | 予約・取寄 | 複写申込 | 自動書庫 |
|---|---|---|---|---|---|---|---|---|---|---|
|
|
: hbk | 理系図3F 数理独自 | SERE/20/1 | 2003 |
|
023212003003248 |
|
|||
|
|
: hbk | 理系図3F 数理独自 | SERE/20/1A | 2003 |
|
023212003003251 |
|
書誌詳細
| 一般注記 | Includes bibliographical references (p. 254-261) and index |
|---|---|
| 著者標目 | *Seress, Ákos, 1958- |
| 件 名 | LCSH:Permutation groups LCSH:Algorithms |
| 分 類 | LCC:QA175 DC21:512/.2 NDC9:411.65 |
| 書誌ID | 1001385032 |
| ISBN | 052166103X |
| NCID | BA62080545 |
| 巻冊次 | : hbk ; ISBN:052166103X |
| 登録日 | 2009.11.02 |
| 更新日 | 2009.11.02 |