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

By Rod G. Downey

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.

• Format: Hardcover
• Language: English
• ISBN: 3110168103
• ISBN13: 9783110168105
• Release Date: October 2001
• Publisher: de Gruyter
• Length: 178 Pages
• Weight: 1.25 lbs.
• Dimensions: 0.4" x 6.1" x 9.2"
• Age Range: 22 years and up
• Grade Range: Postsecondary