June 21st Fatjer's Day! All the best gift ideas. Shop NowJune 21st Fatjer's Day! All the best gift ideas. Shop Now
Add Item to wish listAdd Item to wish list

P, NP, and NP-Completeness: The Basics of Computational Complexity

By Oded Goldreich
eBook
$58.00
By Oded Goldreich
Membership Card Icon
Collect stamps to save with Rewards. 10 stamps = $5. Learn More
Formats
See All Formats & Editions
Select a store to view item availability.

Available on compatible , the free NOOK App, and in My Digital Library

NOOK App

Download NOOK app

NOOK Devices

NOOK eReaders

  • NOOK GlowLight 4 Plus
  • NOOK GlowLight 4e
  • NOOK GlowLight 4
  • NOOK GlowLight Plus 7.8"
  • NOOK GlowLight 3
  • NOOK GlowLight Plus 6"

NOOK Tablets

  • NOOK 9" Lenovo Tablet
  • NOOK 10" HD Lenovo Tablet
  • NOOK Tablet 7" & 10.1"
  • NOOK by Samsung Galaxy Tab 7.0 [Tab A and Tab 4]
  • NOOK by Samsung [Tab 4 10.1, S2 & E]

Free NOOK Reading Apps

  • NOOK for iOS
  • NOOK for Android

BN.com website

Go to your Digital Library in My Account

Limit 1 per customer
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,...

Categories