Matches in Harvard for { <http://id.lib.harvard.edu/aleph/007953163/catalog> ?p ?o. }
Showing items 1 to 25 of
25
with 100 items per page.
- catalog contributor b11026066.
- catalog contributor b11026067.
- catalog contributor b11026068.
- catalog created "c1999.".
- catalog date "1999".
- catalog date "c1999.".
- catalog dateCopyrighted "c1999.".
- catalog description "1. Computers, Complexity, and Intractability from the Parametric Point of View -- 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: Monotone W[2t + 1] = W[2t] and Antimonotone W[2t + 2] = W[2t + 1] -- 19. The Structure of Languages Under Parameterized Reducibilities -- A. A Problem Compendium and Guide to W-Hierarchy Completeness, Hardness, and Classification; and Some Research Horizons -- B. Research Horizons.".
- catalog description "Includes bibliographical references (pages 489-516) and index.".
- catalog extent "xv, 533 p. :".
- catalog hasFormat "Parameterized complexity.".
- catalog identifier "038794883X (hc : alk. paper)".
- catalog isFormatOf "Parameterized complexity.".
- catalog isPartOf "Monographs in computer science".
- catalog issued "1999".
- catalog issued "c1999.".
- catalog language "eng".
- catalog publisher "New York : Springer,".
- catalog relation "Parameterized complexity.".
- catalog subject "511.3 21".
- catalog subject "Computational complexity.".
- catalog subject "QA267.7 .D68 1997".
- catalog tableOfContents "1. Computers, Complexity, and Intractability from the Parametric Point of View -- 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: Monotone W[2t + 1] = W[2t] and Antimonotone W[2t + 2] = W[2t + 1] -- 19. The Structure of Languages Under Parameterized Reducibilities -- A. A Problem Compendium and Guide to W-Hierarchy Completeness, Hardness, and Classification; and Some Research Horizons -- B. Research Horizons.".
- catalog title "Parameterized complexity / R.G. Downey, M.R. Fellows.".
- catalog type "text".