Aspects of complexity : minicourses in algorithmics, complexity, and computational algebra, mathematics workshop, Kaikoura, January 7-15, 2000
Author(s)
Bibliographic Information
Aspects of complexity : minicourses in algorithmics, complexity, and computational algebra, mathematics workshop, Kaikoura, January 7-15, 2000
（De Gruyter series in logic and its applications, 4）
Walter de Gruyter, c2001
Available at / 13 libraries
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
C-P||Kaikoura||2000.103031020
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references
Description and Table of Contents
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.
Table of Contents
E. Allender and C. McCartin, Basic Complexity * F. Cucker, Real Computation * P. Diaconis, Randomized Algorithms * M. Fellows, Parameterized Complexity: New Developments and Research Frontiers * L. Fortnow, Kolmogorov Complexity * A. Niemeyer and C. Praeger, Complexity and Computation in Matrix Groups * D. Welsh and A. Gale, The Complexity of Counting Problems * H. Woodin, The Conjecture.
by "Nielsen BookData"