Lecture Notes in Computer Science

Randomness and Completeness in Computational Complexity

Authors: Melkebeek, Dieter van

Buy this book

eBook $69.99
price for USA (gross)
  • ISBN 978-3-540-44545-6
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $99.00
price for USA
  • ISBN 978-3-540-41492-6
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
About this book

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.

Table of contents (8 chapters)

Buy this book

eBook $69.99
price for USA (gross)
  • ISBN 978-3-540-44545-6
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $99.00
price for USA
  • ISBN 978-3-540-41492-6
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Randomness and Completeness in Computational Complexity
Authors
Series Title
Lecture Notes in Computer Science
Series Volume
1950
Copyright
2000
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-540-44545-6
DOI
10.1007/3-540-44545-5
Softcover ISBN
978-3-540-41492-6
Series ISSN
0302-9743
Edition Number
1
Number of Pages
XIII, 198
Topics