{"product_id":"computers-and-intractability-a-guide-to-the-theory-of-np-co","title":"Computers and Intractability: A Guide to the Theory of NP-Co","description":"\n        \u003cp\u003e\u003cstrong\u003eISBN:\u003c\/strong\u003e 0716710455\u003c\/p\u003e\n        \u003cp\u003e\u003cstrong\u003eAuthor:\u003c\/strong\u003e Michael R. Garey\u003c\/p\u003e\n        \u003cp\u003e\u003cstrong\u003eCondition:\u003c\/strong\u003e new\u003c\/p\u003e\n        \u003cp\u003eA readable, straightforward guide by two authors with extensive experience in the field. This text shows how to recognize NP-complete problems and offers practical suggestions for dealing with them effectively. It is suitable as a supplement to courses in algorithm design, computational complexity, operations research, or combinatorial mathematics, and as a text for seminars on approximation algorithms or computational complexity.\u003c\/p\u003e\n        \u003cul\u003e\u003cli\u003eUsed Book in Good Condition\u003c\/li\u003e\u003c\/ul\u003e\n        ","brand":"Miakarts Books","offers":[{"title":"Default Title","offer_id":49676926976240,"sku":"NEW0716710455","price":87.4,"currency_code":"USD","in_stock":false}],"url":"https:\/\/ethereallybeautiful.com\/products\/computers-and-intractability-a-guide-to-the-theory-of-np-co","provider":"Ethereally Beautiful","version":"1.0","type":"link"}