東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Permutation group algorithms

NetLibrary, Inc.

FindBook

Google Book

Amazon

博客來

Permutation group algorithms

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Permutation group algorithms/ 槎kos Seress.
作者:	Seress, 槎kos,
出版者:	New York :Cambridge University Press, : 2003.,
面頁冊數:	ix, 264 p. ;23 cm.
叢書名:	Cambridge tracts in mathematics ;
內容註:	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.
標題:	Algorithms. -
電子資源:	http://www.netLibrary.com/urlapi.asp?action=summary&v=1&bookid=120693An electronic book accessible through the World Wide Web; click for information
ISBN:	0511066473 (electronic bk.)

Permutation group algorithms
Seress, 槎kos,1958-

Permutation group algorithms[electronic resource] /槎kos Seress. - New York :Cambridge University Press,2003. - ix, 264 p. ;23 cm. - Cambridge tracts in mathematics ;152.

Includes bibliographical references (p. 254-261) and index.

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.

Electronic reproduction.
Boulder, Colo. :
NetLibrary,
2004.

Available via World Wide Web.

ISBN: 0511066473 (electronic bk.)Subjects--Topical Terms:

536374
Algorithms.
Index Terms--Genre/Form:

542853
Electronic books.

LC Class. No.: QA175 / .S47 2003eb

Dewey Class. No.: 512/.21

Permutation group algorithms
LDR:01332nam a2200265 a 45 001 750319
003 OCoLC
005 20071228
006 m d
007 cr cnu---unuuu
008 071228s2003 nyu sb 001 0 eng d
020 $a 0511066473 (electronic bk.)
035 $a ocm57146432
040 $a N $c N
049 $a AMFA
050 1 4 $a QA175 $b .S47 2003eb
082 0 4 $a 512/.21 $2 22
100 $a Seress, 槎kos, $d 1958- $3 864319
245 1 0 $a Permutation group algorithms $h [electronic resource] / $c 槎kos Seress.
260 $a New York : $c 2003. $b Cambridge University Press,
300 $a ix, 264 p. ; $c 23 cm.
440 0 $a Cambridge tracts in mathematics ; $v 152
504 $a Includes bibliographical references (p. 254-261) and index.
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.
533 $a Electronic reproduction. $b Boulder, Colo. : $c NetLibrary, $d 2004. $n Available via World Wide Web. $n Access may be limited to NetLibrary affiliated libraries.
650 $a Algorithms. $3 536374
650 $a Permutation groups. $3 518198
655 $a Electronic books. $2 lcsh $3 542853
710 $a NetLibrary, Inc. $3 542851
856 4 0 $3 Bibliographic record display $u http://www.netLibrary.com/urlapi.asp?action=summary&v=1&bookid=120693 $z An electronic book accessible through the World Wide Web; click for information
994 $a 92 $b AMF