Picture 1 of 1
Stock photo
Picture 1 of 1
Stock photo
P, NP, and NP-Completeness : The Basics of Computational Complexity by Oded Goldreich (2010, Trade Paperback)
freshlyprintedbooks (1966)
99.7% positive Feedback
Price:
£37.97
Free postage
Returns:
30 days return. Buyer pays for return postage. If you use an eBay delivery label, it will be deducted from your refund amount.
Condition:
P, NP, and NP-Completeness; The Basics of Computational Complexity 9780521122542 Brand New
- Buy it nowP, NP, and NP-Completeness The Basics of Computational Complexity Goldreich
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
About this product
Product Identifiers
PublisherCambridge University Press
ISBN-100521122546
ISBN-139780521122542
eBay Product ID (ePID)93224814
Product Key Features
Number of Pages216 Pages
LanguageEnglish
Publication NameP, Np, and Np-Completeness : the Basics of Computational Complexity
Publication Year2010
SubjectMachine Theory, General
TypeTextbook
Subject AreaComputers
AuthorOded Goldreich
FormatTrade Paperback
Dimensions
Item Height0.5 in
Item Weight11.3 oz.
Item Length9 in
Item Width6 in
Additional Product Features
Intended AudienceScholarly & Professional
All listings for this product
Be the first to write a review
