{"product_id":"computational-complexity-by-papadimitriou-christos","title":"Computational Complexity by Papadimitriou, Christos","description":"\n        \u003cp\u003e\u003cstrong\u003eISBN:\u003c\/strong\u003e 0201530821\u003c\/p\u003e\n        \u003cp\u003e\u003cstrong\u003eAuthor:\u003c\/strong\u003e Papadimitriou, Christos\u003c\/p\u003e\n        \u003cp\u003e\u003cstrong\u003eCondition:\u003c\/strong\u003e new\u003c\/p\u003e\n        \u003cp\u003eThis text offers a comprehensive and accessible treatment of the theory of algorithms and complexity - the elegant body of concepts and methods developed by computer scientists over the past 30 years for studying the performance and limitations of computer algorithms. Among topics covered are: reductions and NP-completeness, cryptography and protocols, randomized algorithms, and approximability of optimization problems, circuit complexity, the \"structural\" aspects of the P=NP question, parallel computation, the polynomial hierarchy, and many others. Several sophisticated and recent results are presented in a rather simple way, while many more are developed in the form of extensive notes, problems, and hints. The book is surprisingly self-contained, in that it develops all necessary mathematical prerequisites from such diverse fields as computability, logic, number theory, combinatorics and probability.\u003c\/p\u003e\n        \u003cul\u003e\u003cli\u003e\u003c\/ul\u003e\n        ","brand":"Miakarts Books","offers":[{"title":"Default Title","offer_id":49679071183088,"sku":"NEW0201530821","price":266.41,"currency_code":"USD","in_stock":false}],"url":"https:\/\/ethereallybeautiful.com\/products\/computational-complexity-by-papadimitriou-christos","provider":"Ethereally Beautiful","version":"1.0","type":"link"}