Aspects of Complexity

Minicourses in Algorithmics, Complexity and Computational Algebra. Mathematics Workshop, Kaikoura, January 7-15, 2000

Rod Downey, Denis R. Hirschfeldt (Herausgeber)

Buch | Hardcover

VI, 172 Seiten

2001 | 1. Reprint 2010
De Gruyter (Verlag)
978-3-11-016810-5 (ISBN)

Artikel merken

The series is devoted to the publication of high-level monographs on all areas of mathematical logic and its applications. It is addressed to advanced students and research mathematicians, and may also serve as a guide for lectures and for seminars at the graduate level.

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.

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 Conjecture.

"I would recommend this book to all computationally inclined mathematicians and all theoretically inclined computer scientists (including graduate students)." Mathematical Reviews

Erscheint lt. Verlag	19.10.2001
Reihe/Serie	De Gruyter Series in Logic and Its Applications ; 4
Zusatzinfo	Num. figs. and tabl.
Verlagsort	Berlin/Boston
Sprache	englisch
Maße	155 x 230 mm
Gewicht	435 g
Themenwelt	Mathematik / Informatik ► Mathematik ► Allgemeines / Lexika
Schlagworte	Berechenbarkeit • Komplexität • Rekursive Funktion • Turing-Maschine
ISBN-10	3-11-016810-3 / 3110168103
ISBN-13	978-3-11-016810-5 / 9783110168105
Zustand	Neuware