{"product_id":"9780195085914","title":"Limits to Parallel Computation: P-Completeness Theory","description":"With its cogent overview of the essentials of parallel computation as well as lists of P-complete and open problems, extensive remarks corresponding to each problem, and extensive references, this book is the ideal introduction to parallel computing.","brand":"Oxford University Press, USA","offers":[{"title":"Default Title","offer_id":47022497497328,"sku":"9780195085914","price":325.0,"currency_code":"USD","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0737\/7593\/9824\/files\/9780195085914_p0.jpg?v=1763662945","url":"https:\/\/shop-qa.barnesandnoble.com\/products\/9780195085914","provider":"Barnes \u0026 Noble (DEV)","version":"1.0","type":"link"}