{"product_id":"computational-complexity","title":"Computational Complexity","description":"\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","brand":"Pearson Education","offers":[{"title":"Default Title","offer_id":46286562164974,"sku":"9780201530827","price":186.78,"currency_code":"AUD","in_stock":true}],"url":"https:\/\/bookland.com.au\/products\/computational-complexity","provider":"Book Land AU","version":"1.0","type":"link"}