+612 9045 4394
 
CHECKOUT
Parameterized Complexity : Monographs in Computer Science - Rod Downey

Parameterized Complexity

Monographs in Computer Science

Hardcover

Published: 6th November 1998
Ships: 7 to 10 business days
7 to 10 business days
RRP $631.99
$437.50
31%
OFF
or 4 easy payments of $109.38 with Learn more
if ordered within

Other Available Formats (Hide)

  • Paperback View Product Published: 8th October 2012
    $248.20

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.

Preface
Acknowledgements
List of Figures
Computers, Complexity, and Intractability from the Parametric Point of Viewp. 1
Parameterized Tractabilityp. 21
The Basic Definitionsp. 23
Some Ad Hoc Methods: The Methods of Bounded Search Tree and Problem Kernelp. 29
Optimization Problems, Approximation Schemes, and Their Relation with FPTp. 49
The Advice View Revisited and LOGSPACEp. 61
Methods via Automata and Bounded Treewidthp. 67
Well-Quasi-Orderings and the Robertson-Seymour Theoremsp. 143
Miscellaneous Techniquesp. 211
Parameterized Intractabilityp. 225
Reductionsp. 227
The Basic Class W[1] and an Analog of Cook's Theoremp. 235
Some Other W[1]-Hardness Resultsp. 255
The W-Hierarchyp. 283
Beyond W[t]-Hardnessp. 315
Fixed Parameter Analogs of PSPACE and k-Move Gamesp. 331
Provable Intractability: The Class XPp. 341
Structural and Other Resultsp. 351
Another Basis for the W-Hierarchy, the Tradeoff-Theorem, and Randomized Reductionsp. 353
Relationships with Classical Complexity and Limited Nondeterminismp. 363
The Monotone and Antimonotone Collapse Theorems: Monotone W[2t + 1] = W[2t] and Antimonotone W[2t + 2] = W[2t + 1]p. 377
The Structure of Languages Under Parameterized Reducibilitiesp. 389
A Problem Compendium and Guide to W-Hierarchy Completeness, Hardness, and Classification; and Some Research Horizonsp. 441
Research Horizonsp. 481
Referencesp. 489
Indexp. 517
Table of Contents provided by Blackwell. All Rights Reserved.

ISBN: 9780387948836
ISBN-10: 038794883X
Series: Monographs in Computer Science
Audience: Professional
Format: Hardcover
Language: English
Number Of Pages: 533
Published: 6th November 1998
Publisher: Springer-Verlag New York Inc.
Country of Publication: US
Dimensions (cm): 24.13 x 16.51  x 3.18
Weight (kg): 0.91