Books by splitShops

P, Np, and Np-Completeness: The Basics of Computational Complexity - Paperback

$88.74

Tax not included.
Shipping calculated at checkout.

In stock

Order Note:

Purchase Information

Shipping charges, applicable taxes, the final order total, and available payment methods are shown during checkout before payment. Delivery timing varies by item and fulfillment origin. Standard U.S. returns are by mail for eligible new, unopened items within 30 days of carrier delivery. Customers pay standard return shipping; there is no restocking fee. Approved refunds are issued within 5 business days after the return is received and inspected. Standard exchanges are not offered.

Cindi Book items have a flat $9.99 shipping charge. Shopify Collective items use shipping rates set by the supplier. Orders containing items from different fulfillment sources may include more than one shipping charge. Your full shipping total is shown at checkout before payment.

Return eligibility is subject to the full policy. Opened, read, or unsealed books with broken seals or visible wear are final sale. Digital downloads, gift cards, and personalized products are non-refundable. Original shipping charges are not refunded for standard returns. Contact us within 7 days of delivery about damaged, defective, or incorrect items.

by Oded Goldreich (Author)

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.

Number of Pages: 216
Dimensions: 0.6 x 8.9 x 5.9 IN
Illustrated: Yes
Publication Date: August 16, 2010

Pay with

  • Amazon
  • Amazon
  • American Express
  • Apple Pay
  • Diners Club
  • Discover
  • Google Pay
  • Mastercard
  • PayPal
  • Shop Pay
  • Visa

Available payment methods and your final total are shown at checkout before payment.

$88.74