Home Book reviews Contact

DISCLOSURE: When you click on links to various merchants on this site and make a purchase, this can result in this site earning a commission at no extra cost to you. Affiliate programs and affiliations include, but are not limited to, the eBay Partner Network, Amazon and Alibris.

Please share to

2 titles, showing 1-2 sort by PRICE ASC.
Please follow us on AddALL Facebook page twitter page
TITLE

SORT

change title size:
AUTHOR

SORT

change author size:
PRICE

DEALER / SITE

SORT

DESCRIPTION

 

change description size:
M. R. Fellows
author size:
USD
270.75
price size:
AHA-BUCH GmbH /ZVAB
dealer size:
ISBN10: 038794883X, ISBN13: 9780387948836, [publisher: Springer New York] Hardcover Druck auf Anfrage Neuware - Printed after ordering - The idea for this book was conceived over the second bottle of Villa Maria's Caber net Medot '89, at the dinner of the Australasian Combinatorics Conference held at Palmerston North, New Zealand in December 1990, where the authors first met and discovered they had a number of interests in common. Initially, we embarked on a small project to try to formulate reductions to address the apparent parame terized intractability of DOMINATING SET, and to introduce a structure in which to frame our answers. Having spent several months trying to get the definitions for the reductions right (they now seem so obvious), we turned to our tattered copies of Garey and Johnson's work [239]. We were stunned to find that virtually none of the classical reductions worked in the parameterized setting. We then wondered if we'd be able to find any interesting reductions. Several years, many more bottles, so many papers, and reductions later it [3] seemed that we had unwittingly stumbled upon what we believe is a truly central and new area of complexity theory. It seemed to us that the material would be of great interest to people working in areas where exact algorithms for a small range of parameters are natural and useful (e. g. , Molecular Biology, VLSI design). The tractability theory was rich with distinctive and powerful ...
Show/Hide image
description size:
M. R. Fellows
author size:
USD
303.07
price size:
AHA-BUCH GmbH /AbebooksDE
dealer size:
ISBN10: 038794883X, ISBN13: 9780387948836, [publisher: Springer New York] Hardcover Druck auf Anfrage Neuware - Printed after ordering - The idea for this book was conceived over the second bottle of Villa Maria's Caber net Medot '89, at the dinner of the Australasian Combinatorics Conference held at Palmerston North, New Zealand in December 1990, where the authors first met and discovered they had a number of interests in common. Initially, we embarked on a small project to try to formulate reductions to address the apparent parame terized intractability of DOMINATING SET, and to introduce a structure in which to frame our answers. Having spent several months trying to get the definitions for the reductions right (they now seem so obvious), we turned to our tattered copies of Garey and Johnson's work [239]. We were stunned to find that virtually none of the classical reductions worked in the parameterized setting. We then wondered if we'd be able to find any interesting reductions. Several years, many more bottles, so many papers, and reductions later it [3] seemed that we had unwittingly stumbled upon what we believe is a truly central and new area of complexity theory. It seemed to us that the material would be of great interest to people working in areas where exact algorithms for a small range of parameters are natural and useful (e. g. , Molecular Biology, VLSI design). The tractability theory was rich with distinctive and powerful ...
Show/Hide image
description size:

DISCLOSURE: When you use one of our links to make a purchase, we may earn a commission at no extra cost to you.
As an Amazon Associate, AddALL earn commission from qualifying Amazon purchases.


TOO Many Search Results? Refine it!
Exclude: (what you don't want)
Include: (what you want)
Search Results Sort By:
240517094716916124