Randomness and completeness in computational complexity / Dieter van Melkebeek.
| Author/creator | Melkebeek, Dieter van |
| Format | Electronic |
| Publication Info | Berlin ; New York : Springer-Verlag, |
| Description | xv, 196 p. : ill. ; 24 cm. |
| Supplemental Content | Full text available from Springer Books |
| Supplemental Content | Full text available from SpringerLINK Lecture Notes in Computer Science Contemporary (1997-present) |
| Subjects |
| Series | Lecture notes in computer science ; 1950 |
| General note | Revision of thesis (Ph.D)--University of Chicago, 1999. |
| Bibliography note | Includes bibliographical references (p. [183]-189) and indexes. |
| Access restriction | Available only to authorized users. |
| Technical details | Mode of access: World Wide Web |
| Genre/form | Electronic books. |
| LCCN | 00069239 |
| ISBN | 3540414924 |
Availability
| Library | Location | Call Number | Status | Item Actions |
|---|---|---|---|---|
| Electronic Resources | ✔ Available |