FREE delivery to all EXCLUSIVE BOOKS stores nationwide. FREE delivery to your door on all orders over R450. Excludes all international deliveries.

  • Safe delivery by Christmas SANTA SAFE
    Permutation Group Algorithms

Permutation Group Algorithms

Ákos Seress
    Product form
      FORMAT: Hardback

      R 5,840.20 Price and availability exclusive to website

      YOU COULD EARN 5,840.20 FUTURE RETAIL DISCOUNTS.
      ESTIMATED DELIVERY: Approx. 10 - 15 Business Days
      BUY NOW PAY LATER
      From R 973.36 per month!
      3x monthly payments of R 1,946.73 with
      4x fortnightly payments of R 1,460.05 with

      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, including 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.

      Format: Hardback CONTRIBUTORS: Ákos Seress EAN: 9780521661034 COUNTRY: United Kingdom PAGES: 274 WEIGHT: 520 g HEIGHT: 231 mm
      PUBLISHED BY: Cambridge University Press DATE PUBLISHED: 2003-03-17 CITY: GENRE: MATHEMATICS / Group Theory WIDTH: 157 mm SPINE:

      Book Themes:

      Groups and group theory

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)

      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, including 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.

      Format: Hardback CONTRIBUTORS: Ákos Seress EAN: 9780521661034 COUNTRY: United Kingdom PAGES: 274 WEIGHT: 520 g HEIGHT: 231 mm
      PUBLISHED BY: Cambridge University Press DATE PUBLISHED: 2003-03-17 CITY: GENRE: MATHEMATICS / Group Theory WIDTH: 157 mm SPINE:

      Book Themes:

      Groups and group theory

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)

      Recently viewed products

      Login

      Forgot your password?

      Don't have an account yet?
      Create account