{"product_id":"computers-and-intractability-a-guide-to-the-theory-of-npcompleteness-series-of-books-in-the-mathematical-sciences-8580000156270","title":"Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)","description":"\u003cdiv class=\"book-description\"\u003e\n\u003cp\u003e\u003cstrong\u003eComputers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences)\u003c\/strong\u003e by Michael R. Garey. paperback edition. ISBN: 8580000156270.\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\u003c\/div\u003e","brand":"W. H. Freeman","offers":[{"title":"Default Title","offer_id":44945370054709,"sku":"ByrdShop_0716710455","price":130.31,"currency_code":"USD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0627\/8139\/0901\/files\/9780716710455_16981988-f78d-49ff-9aae-59097813175d.jpg?v=1778718908","url":"https:\/\/atxbooks.com\/products\/computers-and-intractability-a-guide-to-the-theory-of-npcompleteness-series-of-books-in-the-mathematical-sciences-8580000156270","provider":"ATX Books","version":"1.0","type":"link"}