Image from Amazon.com
Computational complexity theory
Material type:
TextSeries: IAS/Park City mathematics series ; v. 10Publication details: Providence, R.I. : American Mathematical Society, Institute for Advanced Study, 2004Description: xiv, 389 p. : ill. ; 26 cmISBN: - 082182872X (hardcover : acid-free paper)
| Item type | Current library | Home library | Collection | Call number | Status | Barcode | |
|---|---|---|---|---|---|---|---|
Book
|
MATH-LiB General Stack | MATH-LiB | NFIC | 511.352 P04 (Browse shelf(Opens below)) | Available | 179546 |
Total holds: 0
Browsing MATH-LiB shelves, Shelving location: General Stack Close shelf browser (Hides shelf browser)
| No cover image available | No cover image available |
|
|
No cover image available | No cover image available | No cover image available | ||
| 511.33 P06 Problems on mapping class groups and related topics | 511.33 P091 Statistical mechanics of quantum lattice systems : | 511.35 N85 Recursion theory | 511.352 P04 Computational complexity theory | 511.352 P12 Computability theory | 511.36 P09 Proof theory | 511.4 N911 Iteration of rational functions : |
Volume contains the lecture notes from the Graduate Summer School program on Computational Complexity Theory held in Princeton in the summer of 2000"--T.p. verso."
There are no comments on this title.
Log in to your account to post a comment.