menu
{ "item_title" : "Permutation Group Algorithms", "item_author" : [" Ákos Seress "], "item_description" : "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.", "item_img_path" : "https://covers3.booksamillion.com/covers/bam/0/52/166/103/052166103X_b.jpg", "price_data" : { "retail_price" : "159.00", "online_price" : "159.00", "our_price" : "159.00", "club_price" : "159.00", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Permutation Group Algorithms|Ákos Seress

Permutation Group Algorithms

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

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.

This item is Non-Returnable

Details

  • ISBN-13: 9780521661034
  • ISBN-10: 052166103X
  • Publisher: Cambridge University Press
  • Publish Date: March 2003
  • Dimensions: 9.1 x 6.2 x 0.9 inches
  • Shipping Weight: 1.14 pounds
  • Page Count: 274

Related Categories

You May Also Like...

    1

BAM Customer Reviews