UID:
edocfu_9959227690802883
Format:
1 online resource (180 p.)
Edition:
Reprint 2010
ISBN:
3-11-088917-X
Series Statement:
De Gruyter series in logic and its applications ; 4
Content:
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
Note:
Description based upon print version of record.
,
Front matter --
,
Basic complexity /
,
Three lectures on real computation /
,
Parameterized complexity: new developments and research frontiers /
,
Kolmogorov complexity /
,
Complexity and computation in matrix groups /
,
The complexity of counting problems /
,
The Ω conjecture /
,
List of contributors
,
Issued also in print.
,
English
Additional Edition:
ISBN 3-11-016810-3
Language:
English
Subjects:
Mathematics
DOI:
10.1515/9783110889178
