| EAN: | 9783110168105 |
|---|---|
| Sachgruppe: | Mathematik |
| Sprache: | Englisch |
| Seitenzahl: | 180 |
| Produktart: | Gebunden |
| Herausgeber: | Downey, Rod Hirschfeldt, Denis R. |
| Veröffentlichungsdatum: | 19.10.2001 |
| Untertitel: | Minicourses in Algorithmics, Complexity and Computational Algebra. Mathematics Workshop, Kaikoura, January 7-15, 2000 |
109,95 €*
Die Verfügbarkeit wird nach ihrer Bestellung bei uns geprüft.
Bücher sind in der Regel innerhalb von 1-2 Werktagen abholbereit.
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.
Verwandte Artikel