{"product_id":"9780387948836","title":"Parameterized Complexity","description":"\u003cp\u003eAn approach to complexity theory which offers a means of analysing algorithms in terms of their tractability. The authors consider the problem in terms of parameterized languages and taking \"k-slices\" of the language, thus introducing readers to new classes of algorithms which may be analysed more precisely than was the case until now. The book is as self-contained as possible and includes a great deal of background material. As a result, computer scientists, mathematicians, and graduate students interested in the design and analysis of algorithms will find much of interest.\u003c\/p\u003e","brand":"Springer New York","offers":[{"title":"Default Title","offer_id":47025198825712,"sku":"9780387948836","price":239.0,"currency_code":"USD","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0737\/7593\/9824\/files\/9780387948836_p0.jpg?v=1763696424","url":"https:\/\/shop-qa.barnesandnoble.com\/products\/9780387948836","provider":"Barnes \u0026 Noble (DEV)","version":"1.0","type":"link"}