{"product_id":"9783540210450","title":"Complexity Theory: Exploring the Limits of Efficient Algorithms","description":"\u003ch1\u003eComplexity Theory: Exploring the Limits of Efficient Algorithms\u003c\/h1\u003e \u003ch2\u003eWegener, Ingo; Pruim, R.\u003c\/h2\u003e \u003cp\u003e\u003c\/p\u003e\u003cp\u003eComplexity theory is the theory of determining the necessary resources for the solution of algorithmic problems and, therefore, the limits of what is possible with the available resources. An understanding of these limits prevents the search for non-existing efficient algorithms. This textbook considers randomization as a key concept and emphasizes the interplay between theory and practice:\u003c\/p\u003e\n\u003cp\u003eNew branches of complexity theory continue to arise in response to new algorithmic concepts, and its results - such as the theory of NP-completeness - have influenced the development of all areas of computer science.\u003c\/p\u003e\n\u003cp\u003eThe topics selected have implications for concrete applications, and the significance of complexity theory for today's computer science is stressed throughout.\u003c\/p\u003e \u003ch3\u003eDetails\u003c\/h3\u003e \u003cp\u003ePublished by: Springer\u003c\/p\u003e \u003cp\u003ePublication Date: 2005-04-11\u003c\/p\u003e \u003cp\u003eFormat: Hardcover\u003c\/p\u003e \u003cp\u003eISBN-13: 9783540210450\u003c\/p\u003e \u003cp\u003eDOI: 10.1007\/3-540-27477-4\u003c\/p\u003e \u003cp\u003eDimensions: 235cm x155cm\u003c\/p\u003e \u003cp\u003ePages: 308\u003c\/p\u003e ","brand":"Springer-Verlag","offers":[{"title":"Default Title","offer_id":45986191573132,"sku":"9783540210450","price":80.99,"currency_code":"USD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0710\/9545\/1788\/files\/9783540210450.jpg?v=1776429375","url":"https:\/\/fh90cf-fv.myshopify.com\/products\/9783540210450","provider":"Late Knight Books and Services, LLC","version":"1.0","type":"link"}