Andere Kunden interessierten sich auch für
![Computability]( "Computability")
Computability49,99 €![Zero-Dimensional Schemes]( "Zero-Dimensional Schemes")
Zero-Dimensional Schemes106,99 €![First International Tainan-Moscow Algebra Workshop]( "First International Tainan-Moscow Algebra Workshop")
First International Tainan-Moscow Algebra Workshop120,99 €![Transcendental Numbers]( "Transcendental Numbers")
Transcendental Numbers128,99 €![Algebra]( "Algebra")
Algebra127,99 €![Automatic Sequences]( "Automatic Sequences")
Automatic Sequences107,99 €![Algebra and Analysis]( "Algebra and Analysis")
Algebra and Analysis106,99 €
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.
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.