Aspects of Complexity
Minicourses in Algorithmics, Complexity and Computational Algebra : Mathematics Workshop, Kaikoura, January 7-15, 2000eBook - 2001
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 i.
Publisher: Berlin ; New York : Walter de Gruyter, 2001
Characteristics: 1 online resource (vi, 169 pages :) : illustrations data file,rda