FREE delivery to all EXCLUSIVE BOOKS stores nationwide. FREE delivery to your door on all orders over R450. Excludes all international deliveries.

CloseClose
CloseClose
Close

P, NP, and NP-Completeness

Oded Goldreich

    Product form
      FORMAT: Hardback

      R 5,545.00 Price and availability exclusive to website

      YOU COULD EARN 5,545 FUTURE RETAIL DISCOUNTS.
      ESTIMATED DELIVERY: Approx. 20 - 30 Business Days
      BUY NOW PAY LATER
      From R 924.16 per month!
      3x monthly payments of R 1,848.33 with
      4x fortnightly payments of R 1,386.25 with

      Format:

      The focus of this book is the P versus NP Question and the theory of NP-completeness. It also provides adequate preliminaries regarding computational problems and computational models. The P versus NP Question asks whether or not finding solutions is harder than checking the correctness of solutions. An alternative formulation asks whether or not discovering proofs is harder than verifying their correctness. It is widely believed that the answer to these equivalent formulations is positive, and this is captured by saying that P is different from NP. Although the P versus NP Question remains unresolved, the theory of NP-completeness offers evidence for the intractability of specific problems in NP by showing that they are universal for the entire class. Amazingly enough, NP-complete problems exist, and furthermore hundreds of natural computational problems arising in many different areas of mathematics and science are NP-complete.
      CONTRIBUTORS: Oded Goldreich EAN: 9780521192484 COUNTRY: United Kingdom PAGES: WEIGHT: 490 g HEIGHT: 229 cm
      PUBLISHED BY: Cambridge University Press DATE PUBLISHED: 2010-08-16 CITY: GENRE: COMPUTERS / General WIDTH: 147 cm SPINE:

      Book Themes:

      Mathematical theory of computation

      Format:

      The focus of this book is the P versus NP Question and the theory of NP-completeness. It also provides adequate preliminaries regarding computational problems and computational models. The P versus NP Question asks whether or not finding solutions is harder than checking the correctness of solutions. An alternative formulation asks whether or not discovering proofs is harder than verifying their correctness. It is widely believed that the answer to these equivalent formulations is positive, and this is captured by saying that P is different from NP. Although the P versus NP Question remains unresolved, the theory of NP-completeness offers evidence for the intractability of specific problems in NP by showing that they are universal for the entire class. Amazingly enough, NP-complete problems exist, and furthermore hundreds of natural computational problems arising in many different areas of mathematics and science are NP-complete.
      CONTRIBUTORS: Oded Goldreich EAN: 9780521192484 COUNTRY: United Kingdom PAGES: WEIGHT: 490 g HEIGHT: 229 cm
      PUBLISHED BY: Cambridge University Press DATE PUBLISHED: 2010-08-16 CITY: GENRE: COMPUTERS / General WIDTH: 147 cm SPINE:

      Book Themes:

      Mathematical theory of computation

      Customer Reviews

      Be the first to write a review
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      0%
      (0)
      Oded Goldreich is a Professor of Computer Science at the Weizmann Institute of Science and an incumbent of the Meyer W. Weisgal Professorial Chair. He is an editor for the SIAM Journal on Computing, the Journal of Cryptology, and Computational Complexity and previously authored the books Modern Cryptography, Probabilistic Proofs and Pseudorandomness, the two-volume work Foundations of Cryptography, and Computational Complexity: A Conceptual Perspective.

      Recently viewed products

      Close