Computational Complexity / Edition 1

Paperback (Print)
Buy New
Buy New from BN.com
$106.12
(Save 23%)
Eligible for FREE SHIPPING details
Usually ships within 24 hours details
Used and New from Other Sellers
Used and New from Other Sellers
from $26.57
Usually ships in 1-2 business days
(Save 80%)
Other sellers (Paperback)
  • All (17) from $26.57   
  • New (7) from $105.91   
  • Used (10) from $26.57   

More About This Textbook

Overview

This new text offers a comprehensive and accessible treatment of the theory of algorithms and complexity - the elegant body of concepts and methods developed by computer scientists over the past 30 years for studying the performance and limitations of computer algorithms. Among topics covered are: reductions and NP-completeness, cryptography and protocols, randomized algorithms, and approximability of optimization problems, circuit complexity, the "structural" aspects of the P=NP question, parallel computation, the polynomial hierarchy, and many others.

Several sophisticated and recent results are presented in a rather simple way, while many more are developed in the form of extensive notes, problems, and hints. The book is surprisingly self-contained, in that it develops all necessary mathematical prerequisites from such diverse field as computability, logic, number theory, combinatorics, and probability.

Features

  • First unified introduction to computational complexity.
  • Integrates computation, applications, and logic throughout.
  • Provides an accessible introduction to logic, including Boolean logic, first-order logic, and second-order logic.
  • Includes extensive exercises including historical notes, references, and challeging problems.

0201530821B04062001

Read More Show Less

Product Details

  • ISBN-13: 9780201530827
  • Publisher: Addison-Wesley
  • Publication date: 11/30/1993
  • Edition description: New Edition
  • Edition number: 1
  • Pages: 500
  • Product dimensions: 6.00 (w) x 9.10 (h) x 1.20 (d)

Table of Contents

I. ALGORITHMS.

1. Problems and Algorithms.

2. Turing Machines.

3. Undecidability.

II. LOGIC.

1. Boolean Logic.

2. First Order Logic.

3. Undecidability in Logic.

III. P AND NP.

1. Relations between Complexity Classes.

2. Reductions and Completeness.

3. NP-Complete Problems.

4. coNP and Function Problems.

5. Randomized Computation.

6. Cryptography.

7. Approximability.

8. On P vs. NP.

IV. INSIDE P.

1. Parallel Computation.

2. Logarithmic Space.

V. BEYOND NP.

1. The Polynomial Hierarchy.

2. Computation That Counts.

3. Polynomial Space.

4. A Glimpse Beyond. 0201530821T04062001

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Review Guidelines
Add Recommendations
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
    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)