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.
Rezensionen / Stimmen
"I would recommend this book to all computationally inclined mathematicians and all theoretically inclined computer scientists (including graduate students)." Mathematical Reviews
Reihe
Auflage
Sprache
Verlagsort
Zielgruppe
Für Beruf und Forschung
US School Grade: College Graduate Student
Illustrationen
Num. figs. and tabl.
Num. figs. and tabl.
Maße
Höhe: 236 mm
Breite: 160 mm
Dicke: 19 mm
Gewicht
ISBN-13
978-3-11-016810-5 (9783110168105)
Schweitzer Klassifikation
Professor Rod Downey, School of Mathematics and Computer Sciences, Victoria University, Wellington, New Zealand. Professor Denis Hirschfeldt, School of Mathematics and Computer Sciences, Victoria University, Wellington, New Zealand.
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 O Conjecture.
