menu
{ "item_title" : "Aspects of Complexity", "item_author" : [" Rod Downey", "Denis R. Hirschfeldt "], "item_description" : "The book contains 8 detailed expositions of the lectures given at the Kaikoura 2000 Workshop on Computability, Complexity, and Computational Algebra. Topics covered include basic models and questions of complexity theory, the Blum-Shub-Smale model of computation, probability theory applied to algorithmics (randomized alogrithms), parametric complexity, Kolmogorov complexity of finite strings, computational group theory, counting problems, and canonical models of ZFC providing a solution to continuum hypothesis. The text addresses students in computer science or mathematics, and professionals in these areas who seek a complete, but gentle introduction to a wide range of techniques, concepts, and research horizons in the area of computational complexity in a broad sense.", "item_img_path" : "https://covers2.booksamillion.com/covers/bam/3/11/016/810/3110168103_b.jpg", "price_data" : { "retail_price" : "161.99", "online_price" : "161.99", "our_price" : "161.99", "club_price" : "161.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Aspects of Complexity|Rod Downey

Aspects of Complexity : Minicourses in Algorithmics, Complexity and Computational Algebra. Mathematics Workshop, Kaikoura, January 7-15, 2000

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

Overview

The book contains 8 detailed expositions of the lectures given at the Kaikoura 2000 Workshop on Computability, Complexity, and Computational Algebra.

Topics covered include basic models and questions of complexity theory, the Blum-Shub-Smale model of computation, probability theory applied to algorithmics (randomized alogrithms), parametric complexity, Kolmogorov complexity of finite strings, computational group theory, counting problems, and canonical models of ZFC providing a solution to continuum hypothesis.

The text addresses students in computer science or mathematics, and professionals in these areas who seek a complete, but gentle introduction to a wide range of techniques, concepts, and research horizons in the area of computational complexity in a broad sense.

This item is Non-Returnable

Details

  • ISBN-13: 9783110168105
  • ISBN-10: 3110168103
  • Publisher: de Gruyter
  • Publish Date: October 2001
  • Dimensions: 9.21 x 6.14 x 0.44 inches
  • Shipping Weight: 0.95 pounds
  • Page Count: 178
  • Reading Level: Ages 22-22

Related Categories

You May Also Like...

    1

BAM Customer Reviews