Theory of Computational Complexity (Prentice Hall International Series in Computer Science) Book + PRICE WATCH * Amazon pricing is not included in price watch

Theory of Computational Complexity (Prentice Hall International Series in Computer Science) Book

Using a balanced approach that is partly algorithmic and partly structuralist, this book systematically reviews the most significant results obtained in the study of computational complexity theory. KEY TOPICS: Considers properties of complexity classes, inclusions between classes, implications between several hypotheses about complexity classes, and identification of structural properties of sets that affect their computational complexity. Features over 120 worked examples, over 200 problems, and 400 figures. For those interested in complexity and computability, algorithm design, operations research, and combinational mathematic.Read More

from£78.28 | RRP: £55.99
* Excludes Voucher Code Discount Also available Used from £12.00
  • 0139153802
  • 9780139153808
  • Daniel Bovet, Pierluigi Crescenzi
  • 1 November 1993
  • Prentice Hall
  • Hardcover (Book)
  • 330
  • 1
As an Amazon Associate we earn from qualifying purchases. If you click through any of the links below and make a purchase we may earn a small commission (at no extra cost to you). Click here to learn more.

Would you like your name to appear with the review?

We will post your book review within a day or so as long as it meets our guidelines and terms and conditions. All reviews submitted become the licensed property of www.find-book.co.uk as written in our terms and conditions. None of your personal details will be passed on to any other third party.

All form fields are required.