Authors:
- 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 new classes of algorithms which may be analyzed more precisely than before This book will be of great value to computer scientists and mathematicians interested in the design and analysis of algorithms
Part of the book series: Monographs in Computer Science (MCS)
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (19 chapters)
-
Front Matter
-
Computers, Complexity, and Intractability from the Parametric Point of View
-
Parameterized Tractability
-
Front Matter
-
-
Structural and Other Results
-
Front Matter
-
About this book
Authors and Affiliations
-
Department of Mathematics, Victoria University, Wellington, Wellington, New Zealand
R. G. Downey
-
Department of Computer Science, University of Victoria, Victoria, Victoria, Canada
M. R. Fellows
Bibliographic Information
Book Title: Parameterized Complexity
Authors: R. G. Downey, M. R. Fellows
Series Title: Monographs in Computer Science
DOI: https://doi.org/10.1007/978-1-4612-0515-9
Publisher: Springer New York, NY
-
eBook Packages: Springer Book Archive
Copyright Information: Springer Science+Business Media New York 1999
Hardcover ISBN: 978-0-387-94883-6Published: 06 November 1998
Softcover ISBN: 978-1-4612-6798-0Published: 08 October 2012
eBook ISBN: 978-1-4612-0515-9Published: 06 December 2012
Series ISSN: 0172-603X
Series E-ISSN: 2512-5486
Edition Number: 1
Number of Pages: XV, 533
Topics: Theory of Computation, Mathematical Logic and Foundations, Applications of Mathematics, Combinatorics, Algorithm Analysis and Problem Complexity