Description: P, NP, and NP-Completeness : The Basics of Computational Complexity by Oded Goldreich, 2010.Trade paperback in great condition, just some light underlining.See pictures. They will help answer questions about edition, condition, and other features of the book(s). CA08072024 Do something great for your tomorrow; read a book older than you! Browse my store full of over 4000 rare, out of print, eclectic, and hard-to-find books. If you?re a collector or a researcher or a ?page flipper?, then you?re in the right place. I ?flip? ALL the pages, the entire book, from where I found it to your library at the best price possible. https://www.ebay.com/str/phoebecreektradingcompany I?ve sold increasingly more hard-to-find books each of my eight years in business by making sure my customers get a good deal. That is my main goal for collectors and readers: a good deal. I always combine shipping where possible on multiples to save you money. And I package appropriately, taking great care with delicate items. Wayne
Price: 28 USD
Location: Johnson City, Tennessee
End Time: 2024-11-10T12:25:17.000Z
Shipping Cost: 4.63 USD
Product Images
Item Specifics
Restocking Fee: No
Return shipping will be paid by: Buyer
All returns accepted: Returns Accepted
Item must be returned within: 14 Days
Refund will be given as: Money Back
Number of Pages: 216 Pages
Language: English
Publication Name: P, Np, and Np-Completeness : the Basics of Computational Complexity
Publisher: Cambridge University Press
Item Height: 0.5 in
Subject: Machine Theory, General
Publication Year: 2010
Type: Textbook
Item Weight: 11.3 Oz
Item Length: 9 in
Author: Oded Goldreich
Subject Area: Computers
Item Width: 6 in
Format: Trade Paperback
