UID:
almahu_9949462264802882
Umfang:
1 online resource (172 p.) :
,
Num. figs. and tabl.
Ausgabe:
Reprint 2010
ISBN:
9783110889178
,
9783110238570
Serie:
De Gruyter Series in Logic and Its Applications , 4
Inhalt:
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.
Anmerkung:
Frontmatter --
,
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.
,
Mode of access: Internet via World Wide Web.
,
In English.
In:
DGBA Backlist Complete English Language 2000-2014 PART1, De Gruyter, 9783110238570
In:
DGBA Backlist Mathematics 2000-2014 (EN), De Gruyter, 9783110238471
In:
DGBA Mathematics - 2000 - 2014, De Gruyter, 9783110637205
Weitere Ausg.:
ISBN 9783110168105
Sprache:
Englisch
Fachgebiete:
Mathematik
DOI:
10.1515/9783110889178
URL:
https://doi.org/10.1515/9783110889178
URL:
https://www.degruyter.com/isbn/9783110889178
Bookmarklink