Theory of Computational Complexity / Edition 1

Hardcover (Print)
Buy New
Buy New from BN.com
$163.05
Buy Used
Buy Used from BN.com
$122.71
(Save 39%)
Item is in good condition but packaging may have signs of shelf wear/aging or torn packaging.
Condition: Used – Good details
Used and New from Other Sellers
Used and New from Other Sellers
from $19.99
Usually ships in 1-2 business days
(Save 90%)
Other sellers (Hardcover)
  • All (17) from $19.99   
  • New (7) from $101.00   
  • Used (10) from $19.99   

Overview

A complete treatment of fundamentals and recent advances in complexity theory Complexity theory studies the inherent difficulties of solving algorithmic problems by digital computers. This comprehensive work discusses the major topics in complexity theory, including fundamental topics as well as recent breakthroughs not previously available in book form. Theory of Computational Complexity offers a thorough presentation of the fundamentals of complexity theory, including NP-completeness theory, the polynomial-time hierarchy, relativization, and the application to cryptography. It also examines the theory of nonuniform computational complexity, including the computational models of decision trees and Boolean circuits, and the notion of polynomial-time isomorphism. The theory of probabilistic complexity, which studies complexity issues related to randomized computation as well as interactive proof systems and probabilistically checkable proofs, is also covered. Extraordinary in both its breadth and depth, this volume:
* Provides complete proofs of recent breakthroughs in complexity theory
* Presents results in well-defined form with complete proofs and numerous exercises
* Includes scores of graphs and figures to clarify difficult material An invaluable resource for researchers as well as an important guide for graduate and advanced undergraduate students, Theory of Computational Complexity is destined to become the standard reference in the field.

Read More Show Less

Editorial Reviews

From the Publisher

"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 fundamentals 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 excellent addition to the literature. (Bulleting of the London Mathematical Society, Volume 33, 2001)

"The book...is a graduate text...however, it can also be used profitably by researchers in theory...the 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
Graduate students in this area of computer science will simply find htis book indispensable.
SciTech Book News
Du and Ko present the fundamentals of complexity theory, including NP-completeness theory, the polynomial-time hierarchy, relativization...
Booknews
Du (computer science, University of Minnesota) and Ko (State University of New York) present the fundamentals of complexity theory, including NP-completeness theory, the polynomial-time hierarchy, relativization, and the applications of cryptography. The graduate-level textbook also examines the theory of nonuniform computational complexity, and the theory of probabilistic complexity. Annotation c. Book News, Inc., Portland, OR (booknews.com)
Read More Show Less

Product Details

Meet the Author

DING-ZHU DU, PhD, is a professor in the Department of Computer Science at the University of Minnesota. KER-I KO, PhD, is a professor in the Department of Computer Science at the State University of New York at Stony Brook.

Read More Show Less

Table of Contents

UNIFORM COMPLEXITY.

Models of Computation and Complexity Classes.

NP-Completeness.

The Polynomial-Time Hierarchy and Polynomial Space.

Structure of NP.

NONUNIFORM COMPLEXITY.

Decision Trees.

Circuit Complexity.

Polynomial-Time Isomorphism.

PROBABILISTIC COMPLEXITY.

Probabilistic Machines and Complexity Classes.

Complexity of Counting.

Interactive Proof Systems.

Probabilistically Checkable Proofs and NP-Hard Optimization Problems.

Bibliography.

Index.

Read More Show Less

Customer Reviews

Average Rating 3.5
( 2 )
Rating Distribution

5 Star

(1)

4 Star

(0)

3 Star

(0)

2 Star

(1)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously
Sort by: Showing all of 2 Customer Reviews
  • Posted June 7, 2013

    I¿m loving McDonalds for fast food... MyDeals247 for the best de

    I’m loving McDonalds for fast food... MyDeals247 for the best deals;))

    Was this review helpful? Yes  No   Report this review
  • Anonymous

    Posted January 14, 2002

    It is really not a good text book

    It is so unfortunate for me to use this book as a text. It is dense and hard to follow, without examples and explanations. Maybe it is good for experts, but I am sure it is not good for beginners.

    Was this review helpful? Yes  No   Report this review
Sort by: Showing all of 2 Customer Reviews

If you find inappropriate content, please report it to Barnes & Noble
Why is this product inappropriate?
Comments (optional)