{"product_id":"theory-of-computational-complexity","title":"Theory of Computational Complexity","description":"\u003cp\u003e\u003cb\u003ePraise for the \u003ci\u003eFirst Edition\u003c\/i\u003e\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003e\"... complete, up-to-date coverage of computational complexity theory...the book promises to become the standard reference on computational complexity.\"\u003cbr\u003e—\u003cb\u003e\u003ci\u003eZentralblatt MATH\u003c\/i\u003e\u003c\/b\u003e\u003c\/p\u003e \u003cp\u003eA thorough revision based on advances in the field of computational complexity and readers’ feedback, the \u003ci\u003eSecond Edition\u003c\/i\u003e of \u003ci\u003eTheory of Computational Complexity\u003c\/i\u003e presents updates to the principles and applications essential to understanding modern computational complexity theory. The new edition continues to serve as a comprehensive resource on the use of software and computational approaches for solving algorithmic problems and the related difficulties that can be encountered.\u003c\/p\u003e \u003cp\u003eMaintaining extensive and detailed coverage, \u003ci\u003eTheory of Computational Complexity, Second Edition\u003c\/i\u003e, examines the theory and methods behind complexity theory, such as computational models, decision tree complexity, circuit complexity, and probabilistic complexity. The \u003ci\u003eSecond Edition\u003c\/i\u003e also features recent developments on areas such as NP-completeness theory, as well as:\u003c\/p\u003e \u003cul\u003e\n\u003cli\u003eA new combinatorial proof of the PCP theorem based on the notion of expander graphs, a research area in the field of computer science\u003c\/li\u003e\n\u003cli\u003eAdditional exercises at varying levels of difficulty to further test comprehension of the presented material\u003c\/li\u003e\n\u003cli\u003eEnd-of-chapter literature reviews that summarize each topic and offer additional sources for further study \u003c\/li\u003e\n\u003c\/ul\u003e \u003cp\u003e\u003ci\u003eTheory of Computational Complexity, Second Edition\u003c\/i\u003e, is an excellent textbook for courses on computational theory and complexity at the graduate level. The book is also a useful reference for practitioners in the fields of computer science, engineering, and mathematics who utilize state-of-the-art software and computational methods to conduct research.\u003c\/p\u003e","brand":"John Wiley \u0026 Sons Inc","offers":[{"title":"Default Title","offer_id":54251466555736,"sku":"9781118306086","price":124.99,"currency_code":"EUR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0278\/1295\/4195\/files\/9781118306086.jpg?v=1780378270","url":"https:\/\/agendabookshop.com\/products\/theory-of-computational-complexity","provider":"Agenda Bookshop","version":"1.0","type":"link"}