Buy Used
£73.43
+ £2.80 delivery
Used: Good | Details
Condition: Used: Good
Comment: A good reading copy. May contain markings or be a withdrawn library copy. Expect delivery in 20 days.
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 this image

Computational Complexity Paperback – 30 Nov 1993

4.5 out of 5 stars 2 customer reviews

See all 2 formats and editions Hide other formats and editions
Amazon Price
New from Used from
Hardcover
£110.64
Paperback
£125.92 £73.43
click to open popover


Enter your mobile number or email address below and we'll send you a link to download the free Kindle App. Then you can start reading Kindle books on your smartphone, tablet, or computer - no Kindle device required.

  • Apple
  • Android
  • Windows Phone

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



Product details

  • Paperback: 500 pages
  • Publisher: Pearson; 01 edition (30 Nov. 1993)
  • Language: English
  • ISBN-10: 0201530821
  • ISBN-13: 978-0201530827
  • Product Dimensions: 15.5 x 2.8 x 22.6 cm
  • Average Customer Review: 4.5 out of 5 stars 2 customer reviews
  • Amazon Bestsellers Rank: 1,360,992 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

Synopsis

This 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 fields as computability, logic, number theory, combinatorics and probability.

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


Customer reviews

Share your thoughts with other customers
See all 2 customer reviews

Top customer reviews

2 July 1997
Format: Paperback
7 people found this helpful
|Comment|Report abuse
9 June 1997
Format: Paperback
One person found this helpful
|Comment|Report abuse

Most helpful customer reviews on Amazon.com

Amazon.com: 3.9 out of 5 stars 15 reviews
W. Ghost
5.0 out of 5 starsExcellent book, but you need some training
3 November 2007 - Published on Amazon.com
Format: Paperback|Verified Purchase
8 people found this helpful.
Smug
4.0 out of 5 starsgood book for beginners
25 October 2007 - Published on Amazon.com
Format: Paperback|Verified Purchase
4 people found this helpful.
Amazon Customer
4.0 out of 5 starsFour Stars
20 July 2016 - Published on Amazon.com
Format: Paperback|Verified Purchase
susavisa
5.0 out of 5 starsExcellent book in complexity theory
17 April 2014 - Published on Amazon.com
Format: Paperback|Verified Purchase
Jeffrey Rubard
4.0 out of 5 starsThe classic approach to complexity theory
8 December 2003 - Published on Amazon.com
Format: Paperback

Where's My Stuff?

Delivery and Returns

Need Help?