{"product_id":"p-np-and-np-completeness-cambridge-university-press-9780521122542-the-basics-of-computational-complexity","title":"P, NP, and NP-Completeness","description":"\u003cp\u003eDiscover the intriguing world of computational complexity with \u003cstrong\u003eP, NP, and NP-Completeness\u003c\/strong\u003e by renowned author. Published by \u003cstrong\u003eCambridge University Press\u003c\/strong\u003e in 2010, this insightful paperback spans \u003cstrong\u003e216 pages\u003c\/strong\u003e and serves as an essential undergraduate introduction to two pivotal issues in theoretical computer science.\u003c\/p\u003e \n\n\u003cp\u003eThis comprehensive guide begins by laying the groundwork in computability, covering crucial topics such as Turing machines, search and decision problems, algorithms, circuits, and complexity classes. The book then delves into the fascinating P versus NP Question and the intricate theory of NP-completeness, offering readers a broad perspective on these fundamental concepts.\u003c\/p\u003e \n\n\u003cp\u003eWhether you're a student, educator, or simply a curious mind, \u003cstrong\u003eP, NP, and NP-Completeness\u003c\/strong\u003e is a must-have resource for anyone looking to deepen their understanding of computational theory.\u003c\/p\u003e","brand":"Bookshop","offers":[{"title":"Default Title","offer_id":52233316761942,"sku":"9780521122542","price":50.92,"currency_code":"EUR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0886\/3206\/6390\/files\/9780521122542.jpg?v=1767751628","url":"https:\/\/www.bookshop.lv\/products\/p-np-and-np-completeness-cambridge-university-press-9780521122542-the-basics-of-computational-complexity","provider":"Bookshop","version":"1.0","type":"link"}