Get 40% off select Statistics books or choose from thousands of Archive eBooks at 9.99 each!

Monographs in Computer Science

Parameterized Complexity

Authors: Downey, Rodney G., Fellows, M.R.

Free Preview

Buy this book

eBook 118,99 €
price for Spain (gross)
  • ISBN 978-1-4612-0515-9
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover 187,19 €
price for Spain (gross)
  • ISBN 978-0-387-94883-6
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
  • The final prices may differ from the prices shown due to specifics of VAT rules
Softcover 150,79 €
price for Spain (gross)
  • ISBN 978-1-4612-6798-0
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
  • The final prices may differ from the prices shown due to specifics of VAT rules
About this book

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.

Table of contents (19 chapters)

Table of contents (19 chapters)

Buy this book

eBook 118,99 €
price for Spain (gross)
  • ISBN 978-1-4612-0515-9
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover 187,19 €
price for Spain (gross)
  • ISBN 978-0-387-94883-6
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
  • The final prices may differ from the prices shown due to specifics of VAT rules
Softcover 150,79 €
price for Spain (gross)
  • ISBN 978-1-4612-6798-0
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
  • The final prices may differ from the prices shown due to specifics of VAT rules
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Parameterized Complexity
Authors
Series Title
Monographs in Computer Science
Copyright
1999
Publisher
Springer-Verlag New York
Copyright Holder
Springer Science+Business Media New York
eBook ISBN
978-1-4612-0515-9
DOI
10.1007/978-1-4612-0515-9
Hardcover ISBN
978-0-387-94883-6
Softcover ISBN
978-1-4612-6798-0
Series ISSN
0172-603X
Edition Number
1
Number of Pages
XV, 533
Topics