Aspects of Complexity - Minicourses in Algorithmics, Complexity and Computational Algebra. Mathematics Workshop, Kaikoura, January 7-15, 2000 (Hardcover, Reprint 2010)

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.

General

Imprint:	De Gruyter
Country of origin:	Germany
Series:	De Gruyter Series in Logic & its Applications
Release date:	October 2001
First published:	2001
Editors:	Rod Downey • Denis R. Hirschfeldt
Dimensions:	230 x 155 x 11mm (L x W x T)
Format:	Hardcover
Pages:	178
Edition:	Reprint 2010
ISBN-13:	978-3-11-016810-5
Categories:	Books > Science & Mathematics > Mathematics > Mathematical foundations > Mathematical logic Books > Science & Mathematics > Mathematics > Geometry > General Books > Science & Mathematics > Mathematics > Topology > General
LSN:	3-11-016810-3
Barcode:	9783110168105

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!