Aspects of Complexity: Minicourses in Algorithmics, Complexity and Computational Algebra. Mathematics Workshop, Kaikoura, January 7-15, 2000

Author:   Rod Downey ,  Denis R. Hirschfeldt ,  Denis Hirschfeld
Publisher:   De Gruyter
Edition:   Reprint 2010
Volume:   4
ISBN:  

9783110168105


Pages:   178
Publication Date:   19 October 2001
Recommended Age:   College Graduate Student
Format:   Hardback
Availability:   Available To Order   Availability explained
We have confirmation that this item is in stock with the supplier. It will be ordered in for you and dispatched immediately.

Our Price $406.56 Quantity:  
Add to Cart

Share |

Aspects of Complexity: Minicourses in Algorithmics, Complexity and Computational Algebra. Mathematics Workshop, Kaikoura, January 7-15, 2000


Add your own review!

Overview

This text 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, Kol mogorov 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.

Full Product Details

Author:   Rod Downey ,  Denis R. Hirschfeldt ,  Denis Hirschfeld
Publisher:   De Gruyter
Imprint:   De Gruyter
Edition:   Reprint 2010
Volume:   4
Dimensions:   Width: 15.50cm , Height: 1.10cm , Length: 23.00cm
Weight:   0.461kg
ISBN:  

9783110168105


ISBN 10:   3110168103
Pages:   178
Publication Date:   19 October 2001
Recommended Age:   College Graduate Student
Audience:   College/higher education ,  Professional and scholarly ,  Undergraduate ,  Postgraduate, Research & Scholarly
Format:   Hardback
Publisher's Status:   Active
Availability:   Available To Order   Availability explained
We have confirmation that this item is in stock with the supplier. It will be ordered in for you and dispatched immediately.

Table of Contents

E. Allender and C. McCartin, Basic Complexity · F. Cucker, Real Computation · P. Diaconis, Randomized Algorithms · M. Fellows, Parameterized Complexity: New Developments and Research Frontiers · L. Fortnow, Kolmogorov Complexity · A. Niemeyer and C. Praeger, Complexity and Computation in Matrix Groups · D. Welsh and A. Gale, The Complexity of Counting Problems · H. Woodin, The Ω Conjecture.

Reviews

I would recommend this book to all computationally inclined mathematicians and all theoretically inclined computer scientists (including graduate students). Mathematical Reviews


""I would recommend this book to all computationally inclined mathematicians and all theoretically inclined computer scientists (including graduate students)."" Mathematical Reviews


I would recommend this book to all computationally inclined mathematicians and all theoretically inclined computer scientists (including graduate students). Mathematical Reviews


"""I would recommend this book to all computationally inclined mathematicians and all theoretically inclined computer scientists (including graduate students)."" Mathematical Reviews"


Author Information

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.

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

MRG2025CC

 

Shopping Cart
Your cart is empty
Shopping cart
Mailing List