Randomness and completeness in computational complexity / Dieter van Melkebeek.
| Author/creator | Melkebeek, Dieter van |
| Format | Book |
| Publication Info | Berlin ; New York : Springer, ©2000. |
| Description | xv, 196 pages : illustrations ; 24 cm. |
| Subjects |
| Series | Lecture notes in computer science ; 1950 Lecture notes in computer science 1950. ^A466336 |
| Contents | Preliminaties -- Derandomizing Arthur-Merlin games -- Sparseness of complete languages -- Autoreducibility of complete languages -- Size of randomized polynomial time -- Frequency of complete languages -- Frequency of antoreducible languages |
| General note | Revision of thesis (Ph. D.)--University of Chicago, 1999. |
| Bibliography note | Includes bibliographical references (p. [183]-189) and indexes. |
| LCCN | 00069239 |
| ISBN | 3540414924 |
Availability
| Library | Location | Call Number | Status | Item Actions |
|---|---|---|---|---|
| Joyner | General Stacks | QA76.9.M35 M54 2000 | ✔ Available | Place Hold |