Features
- Cover Type: Hard Cover with 0512 pages
- Published by: Wiley-Interscience January 14, 2000
- Written in: English
- ISBN 10 Number: 0471345067
- ISBN 13 Number: 978-0471345060
-
Book Dimensions:
9.3 x 6.1 x 1.3 inches
- Weighs: 1.9 pounds
Product Review
"Here one finds both a basic introduction and comprehensive treatments, especially of topics that have borne spectacular fruit in just the last few years" (Choice, Vol. 38, No. 10, June 2001)
"Graduate students in this area of computer science will simply find htis book indispensable." (CHOICE, June 2001)
"Du and Ko present the basics of complexity theory, including NP-completeness theory, the polynomial-time hierarchy, relativization" (SciTech Book News, Vol. 24, No. 4, December 2000)
Overall, I would recommend this book as an great addition to the literature. (Bulleting of the London Mathematical Society, Volume 33, 2001)
"The bookis a graduate texthowever, it can also be used profitably by researchers in theorythe selection by the authors of the book under review is excellent." (Mathematical Reviews, Issue 2001k)
Excerpt from publisher's description: "promises to become the standard reference on computational complexity." (Zentralblatt MATH, Vol. 963, 2001/13)
"the book promises to become the standard reference on computational complexity" (Zentralblatt MATH, Vol.963, No.13 2001)
CHOICE, June 2001
"Graduate students in this area of computer science will simply find this book indispensable."
Reader ReviewsI can only concur with my fellow Ann Arborite - dense, badly written, often wrong, the works. There's really no perfect textbook that covers this material, but Papadimitriou beats this one handily - plus, he quotes the Clash.
Search for books at
