東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Permutation Group Algorithms.

Seress, Akos.

FindBook

Google Book

Amazon

博客來

Permutation Group Algorithms.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Permutation Group Algorithms./
作者:	Seress, Akos.
其他作者:	Bollobas, B.
出版者:	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 groups. -
電子資源:	http://dx.doi.org/10.1017/CBO9780511546549Click here to view book
ISBN:	9780511546549 (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: 9780511546549 (electronic bk.)Subjects--Topical Terms:

518198
Permutation groups.
Index Terms--Genre/Form:

542853
Electronic books.

LC Class. No.: QA175 .S47 2003eb

Dewey Class. No.: 512.2

Permutation Group Algorithms.
LDR:01567nmm a22002893u 4500 001 1809104
003 AU-PeEL
005 20090601202837.0
006 m d
007 cr mn---------
008 231221t2003 ||| s |||||||eng|d
020 $a 9780511546549 (electronic bk.)
020 $a 9780521661034 (print)
035 $a EBL217726
035 $a EBL217726
035 $a 1809104
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 1898506
245 1 0 $a Permutation Group Algorithms. $h [electronic resource].
260 $a Cambridge : $b Cambridge University Press, $c 2003.
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 518198
655 7 $a Electronic books. $2 lcsh $3 542853
700 1 $a Bollobas, B. $3 1897715
700 1 $a Fulton, W. $3 713901
700 1 $a Katok, A. $3 1897716
700 1 $a Kirwan, F. $3 1897717
700 1 $a Sarnak, P. $3 1897718
710 2 $a Ebooks Corporation. $3 1314793
776 1 $z 9780521661034
856 4 0 $z Click here to view book $u http://dx.doi.org/10.1017/CBO9780511546549