Permutation group algorithms / Ákos Seress.

By:

Seress, Ákos, 1958-

Material type: Text

TextSeries: Cambridge tracts in mathematics ; 152.Publication details: New York : Cambridge University Press, 2003.Description: 1 online resource (ix, 264 pages)Content type:

text

Media type:

computer

Carrier type:

online resource

ISBN:

052166103X
9780521661034
0511066473
9780511066474

Subject(s):

Genre/Form:

Additional physical formats: Print version:: Permutation group algorithms.DDC classification:

512/.2 21

LOC classification:

QA175 .S47 2003eb

Online resources:

Click here to access online

Contents:

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.

Summary: "The central theme is the description of nearly linear-time algorithms, which are extremely fast in terms of both asymptotic analysis and 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."--Jacket.

Item type:

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings
Item type	Home library	Collection	Call number	Materials specified	Status	Date due	Barcode
Electronic-Books	OPJGU Sonepat- Campus	E-Books EBSCO			Available

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

Print version record.

"The central theme is the description of nearly linear-time algorithms, which are extremely fast in terms of both asymptotic analysis and 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."--Jacket.

eBooks on EBSCOhost EBSCO eBook Subscription Academic Collection - Worldwide

There are no comments on this title.

to post a comment.