Parameterized Complexity

Häftad, Engelska, 2012

AvRodney G. Downey,M.R. Fellows,M. R. Fellows

3 369 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Finns i fler format (1)

Inbunden

3 369 kr

Skickas inom 10-15 vardagar

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.

Produktinformation

Utgivningsdatum2012-10-08
Mått155 x 235 x 30 mm
Vikt826 g
FormatHäftad
SpråkEngelska
SerieMonographs in Computer Science
Antal sidor533
FörlagSpringer-Verlag New York Inc.
ISBN9781461267980

Tillhör följande kategorier

1 Computers, Complexity, and Intractability from the Parametric Point of View.- 1.1 Introduction.- 1.2 The Role of Computational Complexity in Modern Science.- 1.3 The Story of Dr.O, Continued.- 1.4 Reworking the Foundations of Computational Complexity.- 1.5 A Deal with the Devil.- 1.6 How Parameters Arise in Practice.- 1.7 A Distinctive Positive Toolkit.- 1.8 O No?.- 1.9 The Barometer of Parametric Intractability.- 1.10 Structural Aspects of Parameterized Complexity.- 1.11 An Overview of Current Research Horizons.- I Parameterized Tractability.- 2 The Basic Definitions.- 3 Some Ad Hoc Methods: The Methods of Bounded Search Tree and Problem Kernel.- 4 Optimization Problems, Approximation Schemes, and Their Relation with FPT.- 5 The Advice View Revisited and LOGSPACE.- 6 Methods via Automata and Bounded Treewidth.- 7 Well-Quasi-Orderings and the Robertson-Seymour Theorems.- 8 Miscellaneous Techniques.- II Parameterized Intractability.- 9 Reductions.- 10 The Basic Class W[1] and an Analog of Cook’s Theorem.- 11 Some Other W[1]-Hardness Results.- 12 The W -Hierarchy.- 13 Beyond W[t]-Hardness.- 14 Fixed Parameter Analogs of PSPACE and k-Move Games.- 15 Provable Intractability: The Class XP.- III Structural and Other Results.- 16 Another Basis for the W -Hierarchy, the Tradeoff-Theorem, and Randomized Reductions.- 17 Relationships with Classical Complexity and Limited Nondeterminism.- 18 The Monotone and Antimonotone Collapse Theorems: MONOTONEW[2t + 1] = W[2t] and ANTIMONOTONEW[2t + 2] = W[2t + 1].- 19 The Structure of Languages Under Parameterized Reducibilities.- IV Appendix.- A A Problem Compendium and Guide to W-Hierarchy Completeness, Hardness, and Classification; and Some Research Horizons.- B Research Horizons.- B.2 A Lineup of Tough Customers.- B.3 ConnectionsBetween Classical and Parameterized Complexity.- B.4 Classification Gaps.- B.5 Structural Issues and Analogs of Classical Results.- References.

Mer från samma författare

Algorithmic Randomness and Complexity

Rodney G. Downey, Denis R. Hirschfeldt, Rodney G Downey, Denis R Hirschfeldt

Inbunden

1 949 kr

Fundamentals of Parameterized Complexity

Rodney G. Downey, Michael R. Fellows

Inbunden

1 779 kr

Fundamentals of Parameterized Complexity

Rodney G. Downey, Michael R. Fellows

Häftad

1 229 kr

Algorithmic Randomness and Complexity

Rodney G. Downey, Denis R. Hirschfeldt

Häftad

1 409 kr

Computable Structure Theory

Rodney G. Downey, Alexander Melnikov

Inbunden

1 779 kr

Mathematical Logic In Asia - Proceedings Of The 9th Asian Logic Conference

DOWNEY R, Sergey S Goncharov, Hiroakira Ono, Rodney G Downey, Russia) Goncharov, Sergei S (Russian Academy Of Sci, Japan) Ono, Hiroakira (Japan Advanced Inst Of Sci & Tech, New Zealand) Downey, Rodney G (Victoria Univ Of Wellington, Sergey S. Goncharov

Inbunden

2 679 kr

Proceedings Of The 12th Asian Logic Conference

Downey Rod, DOWNEY ROD, Rodney G Downey, Jorg Brendle, Robert Goldblatt, Byunghan Kim, New Zealand) Downey, Rodney G (Victoria Univ Of Wellington, Japan) Brendle, Jorg (Kobe University, New Zealand) Goldblatt, Robert (Victoria Univ Of Wellington, South Korea) Kim, Byunghan (Yonsei Univ

Inbunden

2 259 kr