{"product_id":"9783540422006","title":"Theory of Semi-Feasible Algorithms","description":"The primary goal of this book is unifying and making more widely accessible the vibrant stream of research - spanning more than two decades - on the theory of semi-feasible algorithms. In doing so it demonstrates the richness inherent in central notions of complexity: running time, nonuniform complexity, lowness, and NP-hardness. The book requires neither great mathematical maturity nor an extensive background in computational complexity theory or in computer science. Another aim of this book is to lay out a path along which the reader can quickly reach the frontiers of current research, and meet and engage the many exciting open problems in this area.","brand":"Lane A. Hemaspaandra","offers":[{"title":"Default Title","offer_id":47628188909886,"sku":"9783540422006","price":4030.0,"currency_code":"ZAR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4357\/7662\/products\/9783540422006.jpg?v=1707721827","url":"https:\/\/exclusivebooks.co.za\/products\/9783540422006","provider":"Exclusive Books Online","version":"1.0","type":"link"}