Language:
English
繁體中文
Help
回圖書館
Login
Back
Switch To:
Labeled
|
MARC Mode
|
ISBD
Permutation Group Algorithms.
~
Bollobas, B.
Permutation Group Algorithms.
Record Type:
Electronic resources : Monograph/item
Title/Author:
Permutation Group Algorithms./
Author:
Seress, Akos.
other author:
Bollobas, B.
Published:
Cambridge :Cambridge University Press, : 2003.,
Description:
274 p.
Subject:
Permutation groups. -
Online resource:
Click 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:
276817
Permutation groups.
Index Terms--Genre/Form:
96803
Electronic books.
LC Class. No.: QA175 .S47 2003eb
Dewey Class. No.: 512.2
Permutation Group Algorithms.
LDR
:01559nmm a22002773u 4500
001
148412
003
AU-PeEL
005
20090601202837.0
006
m d
007
cr mn---------
008
160127t2003 ||| s |||||||eng|d
020
$a
9780511546549 (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
276816
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
276817
655
7
$a
Electronic books.
$2
local.
$3
96803
700
1
$a
Bollobas, B.
$3
276001
700
1
$a
Fulton, W.
$3
276002
700
1
$a
Katok, A.
$3
276003
700
1
$a
Kirwan, F.
$3
276004
700
1
$a
Sarnak, P.
$3
276005
710
2
$a
Ebooks Corporation.
$3
197505
776
1
$z
9780521661034
856
4 0
$z
Click here to view book
$u
http://ebooks.cambridge.org/ebook.jsf?bid=CBO9780511546549
based on 0 review(s)
Multimedia
Reviews
Add a review
and share your thoughts with other readers
Export
pickup library
Processing
...
Change password
Login