{"product_id":"p-np-and-np-completeness-cambridge-university-press-9780521192484-the-basics-of-computational-complexity-oded-goldreich","title":"P, NP, and NP-Completeness","description":"\u003cp\u003eDelve into the fascinating world of computational complexity with \u003cstrong\u003eP, NP, and NP-Completeness\u003c\/strong\u003e by \u003cstrong\u003eOded Goldreich\u003c\/strong\u003e. Published by \u003cstrong\u003eCambridge University Press\u003c\/strong\u003e in 2010, this insightful hardback offers an extensive introduction tailored for undergraduate students. Spanning \u003cstrong\u003e216 pages\u003c\/strong\u003e, the book provides a comprehensive overview of two pivotal topics in theoretical computer science.\u003c\/p\u003e \n\n\u003cp\u003eBeginning with essential concepts in computability, including Turing machines, search and decision problems, algorithms, circuits, and complexity classes, Goldreich expertly guides readers through the complexities of the P versus NP question and the intriguing theory of NP-completeness. This text is an invaluable resource for anyone looking to deepen their understanding of these critical issues in computer science.\u003c\/p\u003e \n\n\u003cp\u003eExplore the depths of computational theory with this essential guide, perfect for students and enthusiasts alike!\u003c\/p\u003e","brand":"Oded Goldreich","offers":[{"title":"Default Title","offer_id":52233316598102,"sku":"9780521192484","price":138.22,"currency_code":"EUR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0886\/3206\/6390\/files\/9780521192484.jpg?v=1767751627","url":"https:\/\/www.bookshop.ee\/products\/p-np-and-np-completeness-cambridge-university-press-9780521192484-the-basics-of-computational-complexity-oded-goldreich","provider":"Bookshop","version":"1.0","type":"link"}