Items related to Parameterized Complexity (Monographs in Computer Science)
Synopsis
This monograph presents an approach to complexity theory which offers a means of analysing algorithms in terms of their tractability. This will be suitable for graduate students and researchers in computer science and mathematics, particularly those studying complexity theory.
"synopsis" may belong to another edition of this title.
Buy New
View this item
£ 124.20
£ 9.54 shipping from Germany to United Kingdom
Destination, rates & speeds
Search results for Parameterized Complexity (Monographs in Computer Science)
Seller Image
Parameterized Complexity
Published by
Springer New York Okt 2012, 2012
ISBN 10: 1461267986
ISBN 13: 9781461267980
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -An 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. 552 pp. Englisch. Seller Inventory # 9781461267980
Quantity: 2 available
Stock Image
Parameterized Complexity (Monographs in Computer Science)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9781461267980_new
Quantity: Over 20 available
Seller Image
Parameterized Complexity
Print on DemandSeller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This book presents an approach to complexity theory which offers a means of analyzing algorithms in terms of their tractability Downey considers problems in terms of parameterized languages and taking k-slices of the language, giving readers insight into . Seller Inventory # 4189439
Quantity: Over 20 available
Seller Image
Parameterized Complexity
Published by
Springer New York, Springer New York, 2012
ISBN 10: 1461267986
ISBN 13: 9781461267980
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. 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. The intractability theory seemed to have a deep structure and techniques all of its own. Seller Inventory # 9781461267980
Quantity: 1 available
Seller Image
Parameterized Complexity
Published by
Springer New York, Springer New York Okt 2012, 2012
ISBN 10: 1461267986
ISBN 13: 9781461267980
New
Taschenbuch
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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. The intractability theory seemed to have a deep structure and techniques all of its own.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 552 pp. Englisch. Seller Inventory # 9781461267980
Quantity: 1 available
Stock Image
Parameterized Complexity
Seller: Books Puddle, New York, NY, U.S.A.
Seller rating 4 out of 5 stars
Condition: New. pp. 552. Seller Inventory # 2658594373
Quantity: 4 available
Stock Image
Parameterized Complexity
Print on DemandSeller: Majestic Books, Hounslow, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. Print on Demand pp. 552 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam. Seller Inventory # 50965402
Quantity: 4 available
Stock Image
Parameterized Complexity
Print on DemandSeller: Biblios, Frankfurt am main, HESSE, Germany
Seller rating 5 out of 5 stars
Condition: New. PRINT ON DEMAND pp. 552. Seller Inventory # 1858594383
Quantity: 4 available
Stock Image
Parameterized Complexity (Monographs in Computer Science)
Seller: Revaluation Books, Exeter, United Kingdom
Seller rating 5 out of 5 stars
Paperback. Condition: Brand New. reprint edition. 548 pages. 9.25x6.10x1.40 inches. In Stock. Seller Inventory # x-1461267986
Quantity: 2 available