- We will send in 10–14 business days.
/images/books/13019166/9783110168105.jpg)
- Publisher: De Gruyter
- Year: 2001
- ISBN-10: 3110168103
- ISBN-13: 9783110168105
- Format: 15.6 x 23.4 x 1.1 cm, hardcover
- Language: English
- SAVE -10% with code: EXTRA
Aspects of Complexity (e-book) (used book) | bookbook.eu
Reviews
Description
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.
EXTRA 10 % discount with code: EXTRA
The promotion ends in 16d.02:01:07
The discount code is valid when purchasing from 10 €. Discounts do not stack.
- Publisher: De Gruyter
- Year: 2001
- ISBN-10: 3110168103
- ISBN-13: 9783110168105
- Format: 15.6 x 23.4 x 1.1 cm, hardcover
- Language: English English
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.
Reviews