Verwandte Artikel zu Aspects of Complexity: Minicourses in Algorithmics,...

Aspects of Complexity: Minicourses in Algorithmics, Complexity and Computational Algebra. Mathematics Workshop, Kaikoura, January 7-15, 2000 (De Gruyter Series in Logic and Its Applications, 4) - Hardcover

Buch 3 von 10: De Gruyter Series in Logic and Its Applications
 
9783110168105: Aspects of Complexity: Minicourses in Algorithmics, Complexity and Computational Algebra. Mathematics Workshop, Kaikoura, January 7-15, 2000 (De Gruyter Series in Logic and Its Applications, 4)
Hardcover
ISBN 10: 3110168103 ISBN 13: 9783110168105
Verlag: De Gruyter, 2001

Inhaltsangabe

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.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Über die Autorin bzw. den Autor

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.

Von der hinteren Coverseite

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.

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

Verlag
De Gruyter
Erscheinungsdatum
2001
Sprache
Englisch
ISBN 10 
3110168103
ISBN 13 
9783110168105
Einband
Gebundene Ausgabe
Anzahl der Seiten
178
Herausgeber
Downey Rod, Hirschfeldt Denis R.
Kontakt zum Hersteller
Walter de Gruyter GmbH
productsafety@degruyterbrill.com

Genthiner Straße 13
Berlin
10785
Deutschland