Skip to content
Rider Library Catalog
You are not logged in
|
Login
Your session will expire automatically in
0
seconds.
Continue session
End session now
Add to My Lists
Export
MARC Display
Return To Browse
SearchType
Keyword
Author
Title
Journal Title
Series Title
Subject
Genre
Call no.
ISBN / ISSN
Table of Contents
Publisher
Prof/TA
Course
Search
Search Scope
View Entire Collection
Moore Library
Talbott Library
Limit search to available items
Record:  
Prev
Next
Resources
More Information
Bestseller
Author
Seress, Ákos, 1958-
Title
Permutation group algorithms / Ákos Seress.
Publication Info.
New York : Cambridge University Press, 2003.
Online access
Online eBook. Access restricted to current Rider University students, faculty, and staff.
Instructions for reading/downloading this eBook
Item Status
Description
1 online resource (ix, 264 pages).
Physical Medium
polychrome
Description
text file
Series
Cambridge tracts in mathematics ; 152
Cambridge tracts in mathematics ; 152.
Bibliography
Includes bibliographical references (pages 254-261) and index.
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.
Local Note
eBooks on EBSCOhost EBSCO eBook Subscription Academic Collection - North America
Subject
Permutation groups.
Permutation groups.
Algorithms.
Algorithms.
Genre/Form
Electronic books.
Other Form:
Print version: Seress, Ákos, 1958- Permutation group algorithms. New York : Cambridge University Press, 2003 (DLC) 2002022291
ISBN
052166103X
9780521661034
0511066473 (electronic book)
9780511066474 (electronic book)