語系:
繁體中文
English
說明(常見問題)
登入
回首頁
切換:
標籤
|
MARC模式
|
ISBD
Permutation Group Algorithms.
~
Katok, A.
Permutation Group Algorithms.
紀錄類型:
書目-語言資料,印刷品 : Monograph/item
正題名/作者:
Permutation Group Algorithms./
作者:
Seress, Akos.
其他作者:
Sarnak, P.
出版者:
Cambridge :Cambridge University Press, : 2003.,
面頁冊數:
274 p.
標題:
Permutation groups. -
電子資源:
Click here to view book
ISBN:
9780511068607 (electronic bk.)
Permutation Group Algorithms.
Seress, Akos.
Permutation Group Algorithms.
[electronic resource]. - Cambridge :Cambridge University Press,2003. - 274 p.
Cover; Half-title; Title; Copyright; Contents; 1 Introduction; 2 Black-Box Groups; 3 Permutation Groups A Complexity Overview; 4 Bases and Strong Generating Sets; 5 Further Low-Level Algorithms; 6 A Library of Nearly Linear-Time Algorithms; 7 Solvable Permutation Groups; 8 Strong Generating Tests; 9 Backtrack Methods; 10 Large-Base Groups; Bibliography; Index
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.
Electronic reproduction.
Available via World Wide Web.
Mode of access: World Wide Web.
ISBN: 9780511068607 (electronic bk.)Subjects--Topical Terms:
684880
Permutation groups.
Index Terms--Genre/Form:
554714
Electronic books.
LC Class. No.: QA175 .S47 2003eb
Dewey Class. No.: 512.2
Permutation Group Algorithms.
LDR
:01603nam a22002773u 4500
001
628634
003
AU-PeEL
005
20090601202837.0
006
m d
007
cr mn---------
008
100111t2003 ||| s |||||||eng |d
020
$a
9780511068607 (electronic bk.)
020
$a
9780521661034 (print)
035
$a
EBL217726
035
$a
EBL217726
040
$a
AU-PeEL
$c
AU-PeEL
$d
AU-PeEL
050
0 0
$a
QA175 .S47 2003eb
082
0 0
$a
512.2
$a
512/.2
100
1
$a
Seress, Akos.
$3
684879
245
1 0
$a
Permutation Group Algorithms.
$h
[electronic resource].
260
$a
Cambridge :
$c
2003.
$b
Cambridge University Press,
300
$a
274 p.
505
0
$a
Cover; Half-title; Title; Copyright; Contents; 1 Introduction; 2 Black-Box Groups; 3 Permutation Groups A Complexity Overview; 4 Bases and Strong Generating Sets; 5 Further Low-Level Algorithms; 6 A Library of Nearly Linear-Time Algorithms; 7 Solvable Permutation Groups; 8 Strong Generating Tests; 9 Backtrack Methods; 10 Large-Base Groups; Bibliography; Index
520
$a
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.
533
$a
Electronic reproduction.
$n
Available via World Wide Web.
538
$a
Mode of access: World Wide Web.
650
4
$a
Permutation groups.
$3
684880
655
7
$a
Electronic books.
$2
local
$3
554714
700
1
$a
Sarnak, P.
$3
684079
700
1
$a
Kirwan, F.
$3
684078
700
1
$a
Katok, A.
$3
684077
700
1
$a
Fulton, W.
$3
684076
700
1
$a
Bollobas, B.
$3
684075
710
2
$a
Ebooks Corporation.
$3
683803
776
1
$z
9780521661034
856
4 0
$z
Click here to view book
$u
http://nfu.cambridge.patron.eb20.com/Collections/ViewBook/c79c9bf2-4e80-42a4-b7a6-318939799c19#
筆 0 讀者評論
多媒體
評論
新增評論
分享你的心得
Export
取書館別
處理中
...
變更密碼[密碼必須為2種組合(英文和數字)及長度為10碼以上]
登入