Overview

Permutation group algorithms are indispensable in the proofs of many deep results, including the construction and study of sporadic finite simple groups. This work describes the theory behind permutation group algorithms, up to the most recent 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. The book fills a significant gap in the symbolic computation literature for readers interested in using computers in group theory.
ISBN-13

9780521661034

ISBN-10

052166103X

Weight

1.15 Pounds

Dimensions

6.20 x 0.90 x 9.10 In

List Price

$135.00

Edition

1st Edition

Format

Hardcover

Language

English

Pages

274 pages

Publisher

Cambridge University Press

Published On

2003-03-17


View All Offers

Sort by:

Condition
Seller
Seller Comments
Price
✨ Brand New
Seller details
Alibris
★★★★★

Sparks, NV, USA

Print on demand Contains: Line drawings. Cambridge Tracts in Mathematics . 30 b/w illus. Intended f...
$149.18

 Free delivery by: 30 Mar 2026

Used, Like New
Seller details
GreatBookPrices-
★★★★☆

Columbia, MD, USA

100% Money Back Guarantee. Brand New, Perfect Condition. We offer expedited shipping to all US locat...
$180.76

 Free delivery by: 30 Mar 2026

Used, Good
Seller details
Bonita
★★★★☆

Santa Clarita, CA, USA

Access codes and supplements are not guaranteed with used items. May be an ex-library book.
$180.77

 Free delivery by: 30 Mar 2026

Brand New
Seller details
GreatBookPrices-
★★★★☆

Columbia, MD, USA

100% Money Back Guarantee. Brand New, Perfect Condition. We offer expedited shipping to all US locat...
$182.94

 Free delivery by: 30 Mar 2026


Bookstores.com relies on cookies to improve your experience.