| 书目名称 | Parameterized Complexity |
| 编辑 | R. G. Downey,M. R. Fellows |
| 视频video | |
| 概述 | 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 |
| 丛书名称 | Monographs in Computer Science |
| 图书封面 |  |
| 描述 | 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 a |
| 出版日期 | Book 1999 |
| 关键词 | Algorithms; Automat; Graph; algorithm; automata; classification; complexity; complexity theory; optimization |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-1-4612-0515-9 |
| isbn_softcover | 978-1-4612-6798-0 |
| isbn_ebook | 978-1-4612-0515-9Series ISSN 0172-603X Series E-ISSN 2512-5486 |
| issn_series | 0172-603X |
| copyright | Springer Science+Business Media New York 1999 |
发表于 2025-3-21 19:41:25
