Randomness and completeness in computational complexity / Dieter van Melkebeek
(Lecture notes in computer science ; 1950)
| Publisher | Berlin ; New York : Springer-Verlag |
|---|---|
| Year | c2000 |
| Authors | *Melkebeek, Dieter van |
Hide book details.
| Location | Volume | Call No. | Barcode No. | Status | Comments | ISBN | Printed | Restriction | Reserve |
|---|---|---|---|---|---|---|---|---|---|
| Library Main Building 3rd fl. (Foreign Books) |
|
5080:1:1950 | 120006027I |
|
|
|
|
Hide details.
| Material Type | Books |
|---|---|
| Size | xv, 196 p. : ill. ; 24 cm |
| Notes | Revision of thesis (Ph.D)--University of Chicago, 1999 Bibliography: p. [183]-189 Includes indexes |
| Subjects | LCSH:Computer science -- Mathematics
All Subject Search
LCSH:Computational complexity |
| Classification | LCC:QA76.9.M35 DC21:004/.01/51 |
| Language | English |
| ID | 0000411930 |
| ISBN | 3540414924 |
| NCID |
BA4992747X 
|
Similar Items
Usage statistics of this contents
Number of accesses to this page：4times