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.
To be wrong is nothing unless you continue to remember it.
Michener & Rutledge Bookseller via Alibris /Alibris
dealer size: 16
Springer 1998 1999 ed. Hardcover Very Good+ with No dust jacket as issued 038794883X. Text clean and tight; no dust jacket; Monographs In Computer Science; 8vo 8"-9" tall; 548 pages.
ISBN10: 038794883X, ISBN13: 9780387948836, [publisher: Springer] Hardcover Item in good condition. Textbooks may not include supplemental items i.e. CDs, access codes etc. [Montgomery, IL, U.S.A.] [Publication Year: 1998]
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 techniques ...
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 techniques ...
ISBN10: 038794883X, ISBN13: 9780387948836, [publisher: Springer-Verlag New York Inc.] Hardcover Presents an approach to complexity theory which offers a means of analysing algorithms in terms of their tractability. This monograph is suitable for graduate students and researchers in computer science and mathematics, particularly those studying complexity theory. Series: Monographs in Computer Science. Num Pages: 548 pages, biography. BIC Classification: PBCD; PBKD; PBV; PBW; UYA. Category: (P) Professional & Vocational. Dimension: 235 x 155 x 30. Weight in Grams: 951. . 1998. Hardback. . . . . [Galway, GY, Ireland] [Publication Year: 1998]
ISBN10: 038794883X, ISBN13: 9780387948836, [publisher: Springer-Verlag New York Inc.] Hardcover Presents an approach to complexity theory which offers a means of analysing algorithms in terms of their tractability. This monograph is suitable for graduate students and researchers in computer science and mathematics, particularly those studying complexity theory. Series: Monographs in Computer Science. Num Pages: 548 pages, biography. BIC Classification: PBCD; PBKD; PBV; PBW; UYA. Category: (P) Professional & Vocational. Dimension: 235 x 155 x 30. Weight in Grams: 951. . 1998. Hardback. . . . . Books ship from the US and Ireland. [Olney, MD, U.S.A.] [Publication Year: 1998]
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.
