大葉大學圖書館 |

Permutation group algorithms /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
杜威分類號:	512/.2
書名/作者:	Permutation group algorithms // Ákos Seress.
作者:	Seress, Ákos,
面頁冊數:	1 online resource (ix, 264 pages) : : digital, PDF file(s).
附註:	Title from publisher's bibliographic system (viewed on 05 Oct 2015).
標題:	Permutation groups.
標題:	Algorithms.
ISBN:	9780511546549 (ebook)
內容註:	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.
摘要、提要註:	Permutation group algorithms are one of the workhorses of symbolic algebra systems computing with groups. They played an indispensable role in the proof of many deep results, including the construction and study of sporadic finite simple groups. This book describes the theory behind permutation group algorithms, including 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. 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.
電子資源:	http://dx.doi.org/10.1017/CBO9780511546549

Permutation group algorithms /
Seress, Ákos,1958-

Permutation group algorithms /Ákos Seress. - 1 online resource (ix, 264 pages) :digital, PDF file(s). - Cambridge tracts in mathematics ;152. - Cambridge tracts in mathematics ;169..

Title from publisher's bibliographic system (viewed on 05 Oct 2015).

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.

Permutation group algorithms are one of the workhorses of symbolic algebra systems computing with groups. They played an indispensable role in the proof of many deep results, including the construction and study of sporadic finite simple groups. This book describes the theory behind permutation group algorithms, including 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. 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.

ISBN: 9780511546549 (ebook)Subjects--Topical Terms:

566483
Permutation groups.

LC Class. No.: QA175 / .S47 2003

Dewey Class. No.: 512/.2

Permutation group algorithms /
LDR:02288nam a22003018i 4500 001 448591
003 UkCbUP
005 20151005020622.0
006 m|||||o||d||||||||
007 cr||||||||||||
008 161201s2003||||enk o ||1 0|eng|d
020 $a 9780511546549 (ebook)
020 $z 9780521661034 (hardback)
035 $a CR9780511546549
040 $a UkCbUP $b eng $e rda $c UkCbUP
050 0 0 $a QA175 $b .S47 2003
082 0 0 $a 512/.2 $2 21
100 1 $a Seress, Ákos, $d 1958- $e author. $3 643403
245 1 0 $a Permutation group algorithms / $c Ákos Seress.
264 1 $a Cambridge : $b Cambridge University Press, $c 2003.
300 $a 1 online resource (ix, 264 pages) : $b digital, PDF file(s).
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
490 1 $a Cambridge tracts in mathematics ; $v 152
500 $a Title from publisher's bibliographic system (viewed on 05 Oct 2015).
505 0 $a 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.
520 $a Permutation group algorithms are one of the workhorses of symbolic algebra systems computing with groups. They played an indispensable role in the proof of many deep results, including the construction and study of sporadic finite simple groups. This book describes the theory behind permutation group algorithms, including 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. 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.
650 0 $a Permutation groups. $3 566483
650 0 $a Algorithms. $3 182797
776 0 8 $i Print version: $z 9780521661034
830 0 $a Cambridge tracts in mathematics ; $v 169. $3 642585
856 4 0 $u http://dx.doi.org/10.1017/CBO9780511546549