TY - BOOK ID - 150801 TI - Parameterized complexity AU - Downey, R.G. AU - Fellows, M.R. PY - 1999 SN - 038794883X 1461267986 1461205158 PB - New York, N.Y. Springer DB - UniCat KW - Computer science KW - Computational complexity. KW - Complexité de calcul (Informatique) KW - 511.3 KW - Analytical, additive and other number-theory problems. Diophantine approximations KW - 511.3 Analytical, additive and other number-theory problems. Diophantine approximations KW - Complexité de calcul (Informatique) KW - Computational complexity KW - Complexity, Computational KW - Electronic data processing KW - Machine theory KW - Computers. KW - Mathematical logic. KW - Applied mathematics. KW - Engineering mathematics. KW - Combinatorics. KW - Algorithms. KW - Theory of Computation. KW - Mathematical Logic and Foundations. KW - Applications of Mathematics. KW - Algorithm Analysis and Problem Complexity. KW - Algorism KW - Algebra KW - Arithmetic KW - Combinatorics KW - Mathematical analysis KW - Engineering KW - Engineering analysis KW - Algebra of logic KW - Logic, Universal KW - Mathematical logic KW - Symbolic and mathematical logic KW - Symbolic logic KW - Mathematics KW - Algebra, Abstract KW - Metamathematics KW - Set theory KW - Syllogism KW - Automatic computers KW - Automatic data processors KW - Computer hardware KW - Computing machines (Computers) KW - Electronic brains KW - Electronic calculating-machines KW - Electronic computers KW - Hardware, Computer KW - Computer systems KW - Cybernetics KW - Calculators KW - Cyberspace KW - Foundations UR - https://www.unicat.be/uniCat?func=search&query=sysid:150801 AB - 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. ER -