Skip to main content
SpringerLink
Log in

Randomness and Completeness in Computational Complexity

  • Book
  • © 2000

Overview

Authors:
  1. Dieter Melkebeek

    1. Institute for Advanced Studies Einstein Drive, Princeton, NJ, USA

    View author publications

    You can also search for this author in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 1950)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (8 chapters)

  1. Front Matter

    Pages I-XV
    Download chapter PDF

  2. 1. Introduction

    • Dieter van Melkebeek
    Pages 1-11

  3. 2. Preliminaries

    • Dieter van Melkebeek
    Pages 13-52

  4. 3. Derandomizing Arthur-Merlin Games

    • Dieter van Melkebeek
    Pages 53-76

  5. 4. Sparseness of Complete Languages

    • Dieter van Melkebeek
    Pages 77-112

  6. 5. Autoreducibility of Complete Languages

    • Dieter van Melkebeek
    Pages 113-140

  7. 6. The Size of Randomized Polynomial Time

    • Dieter van Melkebeek
    Pages 141-144

  8. 7. The Frequency of Complete Languages

    • Dieter van Melkebeek
    Pages 145-159

  9. 8. The Frequency of Autoreducible Languages

    • Dieter van Melkebeek
    Pages 161-181

  10. Back Matter

    Pages 183-196
    Download chapter PDF
Back to top

Keywords

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.

Authors and Affiliations

  • Institute for Advanced Studies Einstein Drive, Princeton, NJ, USA

    Dieter Melkebeek

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation