Items related to Permutation Group Algorithms (Cambridge Tracts in Mathematic...

Permutation Group Algorithms (Cambridge Tracts in Mathematics, Series Number 152) - Hardcover

 
Image Not Available

Synopsis

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.

"synopsis" may belong to another edition of this title.

Book Description

Permutation group algorithms played an indispensable role in the proof of many deep results, including the construction and study of sporadic finite simple groups. This book describes the theory behind permutation group algorithms, up to the most recent developments. Rigorous complexity estimates, implementation hints, and advanced exercises are included throughout. 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.

Review

"This book provides a virtually complete state-of-the-art account of algorithms for computing with finite permutation groups. Almost all of the algorithms described are accompanied by complete and detailed correctness proofs and complexity analyses. It is very clearly written throughout, and is likely to become the standard and definitive reference work in the field." Mathematical Reviews

"About this title" may belong to another edition of this title.

  • PublisherCambridge University Press
  • Publication date2003
  • ISBN 10 052166103X
  • ISBN 13 9780521661034
  • BindingHardcover
  • LanguageEnglish
  • Edition number1
  • Number of pages274

Buy Used

23 cm. original cloth. 264 pp.... View this item

Shipping: US$ 28.38
From Netherlands to U.S.A.

Destination, rates & speeds

Add to basket

Search results for Permutation Group Algorithms (Cambridge Tracts in Mathematic...

Seller Image

SERESS, A.
Published by UP, Cambridge, 2003
ISBN 10: 052166103X ISBN 13: 9780521661034
Used Hardcover

Seller: Emile Kerssemakers ILAB, Heerlen, Netherlands

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

23 cm. original cloth. 264 pp. bibliography. index. "Cambridge Tracts in Mathematics". -(libr label, library stamps, otherwise (very) good). 525g. Seller Inventory # 72851

Contact seller

Buy Used

US$ 78.70
Convert currency
Shipping: US$ 28.38
From Netherlands to U.S.A.
Destination, rates & speeds

Quantity: 1 available

Add to basket

Stock Image

Seress, Ákos
Published by Cambridge University Press, 2003
ISBN 10: 052166103X ISBN 13: 9780521661034
New Hardcover

Seller: Lucky's Textbooks, Dallas, TX, U.S.A.

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: New. Seller Inventory # ABLIING23Feb2416190011309

Contact seller

Buy New

US$ 141.39
Convert currency
Shipping: US$ 3.99
Within U.S.A.
Destination, rates & speeds

Quantity: Over 20 available

Add to basket

Stock Image

Seress, Ákos
Published by Cambridge University Press, 2003
ISBN 10: 052166103X ISBN 13: 9780521661034
New Hardcover

Seller: Ria Christie Collections, Uxbridge, United Kingdom

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: New. In. Seller Inventory # ria9780521661034_new

Contact seller

Buy New

US$ 138.87
Convert currency
Shipping: US$ 15.25
From United Kingdom to U.S.A.
Destination, rates & speeds

Quantity: Over 20 available

Add to basket

Stock Image

Seress, Ákos
Published by Cambridge University Press, 2003
ISBN 10: 052166103X ISBN 13: 9780521661034
New Hardcover

Seller: California Books, Miami, FL, U.S.A.

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: New. Seller Inventory # I-9780521661034

Contact seller

Buy New

US$ 160.00
Convert currency
Shipping: FREE
Within U.S.A.
Destination, rates & speeds

Quantity: Over 20 available

Add to basket

Stock Image

Akos Seress
ISBN 10: 052166103X ISBN 13: 9780521661034
New Hardcover First Edition

Seller: Grand Eagle Retail, Fairfield, OH, U.S.A.

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Hardcover. Condition: new. Hardcover. Permutation group algorithms are one of the workhorses of symbolic algebra systems computing with groups. They played an indispensable role in the proof of many deep results, including the construction and study of sporadic finite simple groups. This book 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. 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. Permutation group algorithms were instrumental in the proof of many deep results. This book describes the theory, 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9780521661034

Contact seller

Buy New

US$ 169.84
Convert currency
Shipping: FREE
Within U.S.A.
Destination, rates & speeds

Quantity: 1 available

Add to basket

Stock Image

Ãkos Seress
Published by Cambridge Univ Pr, 2003
ISBN 10: 052166103X ISBN 13: 9780521661034
New Hardcover
Print on Demand

Seller: Revaluation Books, Exeter, United Kingdom

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Hardcover. Condition: Brand New. 1st edition. 300 pages. 9.25x6.25x1.00 inches. In Stock. This item is printed on demand. Seller Inventory # __052166103X

Contact seller

Buy New

US$ 160.71
Convert currency
Shipping: US$ 12.73
From United Kingdom to U.S.A.
Destination, rates & speeds

Quantity: 1 available

Add to basket

Seller Image

Seress, Akos|Seress, Kos
Published by Cambridge University Press, 2013
ISBN 10: 052166103X ISBN 13: 9780521661034
New Hardcover
Print on Demand

Seller: moluna, Greven, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Permutation group algorithms were instrumental in the proof of many deep results. This book describes the theory, and includes hints for implementation and advanced exercises. It is recommended for everyone interested in using computers in group theory, and. Seller Inventory # 446944146

Contact seller

Buy New

US$ 120.78
Convert currency
Shipping: US$ 53.47
From Germany to U.S.A.
Destination, rates & speeds

Quantity: Over 20 available

Add to basket

Stock Image

Akos Seress
Published by Cambridge University Press, 2003
ISBN 10: 052166103X ISBN 13: 9780521661034
New Hardcover
Print on Demand

Seller: THE SAINT BOOKSTORE, Southport, United Kingdom

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Hardback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 559. Seller Inventory # C9780521661034

Contact seller

Buy New

US$ 162.05
Convert currency
Shipping: US$ 15.71
From United Kingdom to U.S.A.
Destination, rates & speeds

Quantity: Over 20 available

Add to basket

Seller Image

Akos Seress
Published by Cambridge University Press, 2003
ISBN 10: 052166103X ISBN 13: 9780521661034
New Hardcover

Seller: AHA-BUCH GmbH, Einbeck, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Theory of permutation group algorithms for graduates and above. Exercises and hints for implementation throughout. Seller Inventory # 9780521661034

Contact seller

Buy New

US$ 146.81
Convert currency
Shipping: US$ 33.83
From Germany to U.S.A.
Destination, rates & speeds

Quantity: 1 available

Add to basket

Stock Image

Akos Seress Kos Seress
Published by Cambridge University Press CUP, 2003
ISBN 10: 052166103X ISBN 13: 9780521661034
New Hardcover

Seller: Books Puddle, New York, NY, U.S.A.

Seller rating 4 out of 5 stars 4-star rating, Learn more about seller ratings

Condition: New. pp. 274. Seller Inventory # 26490929

Contact seller

Buy New

US$ 211.93
Convert currency
Shipping: US$ 3.99
Within U.S.A.
Destination, rates & speeds

Quantity: 4 available

Add to basket

There are 5 more copies of this book

View all search results for this book