Randomness and Completeness in Computational Complexity - Lecture Notes in Computer Science 1950 (Paperback)
  • Randomness and Completeness in Computational Complexity - Lecture Notes in Computer Science 1950 (Paperback)
zoom

Randomness and Completeness in Computational Complexity - Lecture Notes in Computer Science 1950 (Paperback)

(author)
£62.99
Paperback 198 Pages / Published: 13/12/2000
  • We can order this

Usually dispatched within 3 weeks

  • This item has been added to your basket
This book contains a revised version of the dissertation the author wrote at the Department of Computer Science of the University of Chicago. The thesis was submitted to the Faculty of Physical Sciences in conformity with the requirements for the PhD degree in June 1999. It was honored with the 1999 ACM Doctoral Dissertation Award in May 2000. Summary Computational complexity is the study of the inherent di culty of compu- tional problems and the power of the tools we may use to solve them. It aims to describe how many resources we need to compute the solution as a function of the problem size. Typical resources include time on sequential and parallel architectures and memory space. As we want to abstract away from details of input representation and speci cs of the computer model, we end up with classes of problems that we can solve within certain robust resource bounds such as polynomial time, parallel logarithmic time, and logarithmic space. Research in complexity theory boils down to determining the relationships between these classes { inclusions and separations. In this dissertation, we focus on the role of randomness and look at various properties of hard problems in order to obtain separations. We also investigate the power of nondeterminism and alternation, as well as space versus time issues. Randomness provides a resource that seems to help in various situations.

Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN: 9783540414926
Number of pages: 198
Weight: 700 g
Dimensions: 235 x 155 x 11 mm
Edition: 2000 ed.

You may also be interested in...

The End of Error
Added to basket
Machine Learning
Added to basket
£39.99
Paperback
Algorithms
Added to basket
£66.49
Hardback
Generative Art
Added to basket
£25.99
Paperback
Gynaecology: Evidence-Based Algorithms
Added to basket
Algorithms Unlocked
Added to basket
Understanding Cryptography
Added to basket
Introduction to Algorithms
Added to basket
Purely Functional Data Structures
Added to basket
Understanding Cryptography
Added to basket

Reviews

Please sign in to write a review

Your review has been submitted successfully.