Only 8 left in stock (more on the way).
Ships from and sold by Amazon.ca. Gift-wrap available.
Used: Very Good | Details
Sold by Shoh Case
Condition: Used: Very Good
Comment: Pages are clean
Have one to sell?
Flip to back Flip to front
Listen Playing... Paused   You're listening to a sample of the Audible audio edition.
Learn more
See all 2 images

Computational Complexity Paperback – Nov 30 1993

4.2 out of 5 stars 8 customer reviews

See all 4 formats and editions Hide other formats and editions
Amazon Price
New from Used from
Hardcover
CDN$ 241.93
Paperback
CDN$ 119.70
CDN$ 119.70 CDN$ 89.44

See more ▸ Deals on Books

click to open popover

No Kindle device required. Download one of the Free Kindle apps to start reading Kindle books on your smartphone, tablet, and computer.

  • Apple
  • Android
  • Windows Phone
  • Android

To get the free app, enter your mobile phone number.



Product details

  • Paperback: 544 pages
  • Publisher: Pearson; 1 edition (Nov. 30 1993)
  • Language: English
  • ISBN-10: 0201530821
  • ISBN-13: 978-0201530827
  • Product Dimensions: 15.7 x 3.6 x 23.2 cm
  • Shipping Weight: 862 g
  • Average Customer Review: 4.2 out of 5 stars 8 customer reviews
  • Amazon Bestsellers Rank: #1,560,597 in Books (See Top 100 in Books)
  • Would you like to tell us about a lower price?
    If you are a seller for this product, would you like to suggest updates through seller support?

  • See Complete Table of Contents

Product description

From the Back Cover

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


8 customer reviews

4.2 out of 5 stars

Review this product

Share your thoughts with other customers

Showing 1-8 of 8 reviews

December 8, 2003
Format: Paperback
One person found this helpful
Comment Report abuse
April 29, 2003
Format: Paperback
February 5, 2004
Format: Paperback
September 14, 2000
Format: Paperback
August 22, 2000
Format: Paperback
June 2, 2003
Format: Paperback
December 22, 1999
Format: Paperback
May 5, 2002
Format: Paperback

Where's My Stuff?

Delivery & Returns

Need Help?