The Resource Parameterized Complexity, by Rodney G. Downey, M.R. Fellows, (electronic resource)

Parameterized Complexity, by Rodney G. Downey, M.R. Fellows, (electronic resource)

Label
Parameterized Complexity
Title
Parameterized Complexity
Statement of responsibility
by Rodney G. Downey, M.R. Fellows
Creator
Contributor
Author
Author
Subject
Language
  • eng
  • eng
Summary
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
Member of
http://library.link/vocab/creatorName
Downey, Rodney G
Dewey number
004.0151
http://bibfra.me/vocab/relation/httpidlocgovvocabularyrelatorsaut
  • f1vwziqzBNo
  • He9XHCrpEmE
Image bit depth
0
Language note
English
LC call number
QA75.5-76.95
Literary form
non fiction
Nature of contents
dictionaries
http://library.link/vocab/relatedWorkOrContributorName
Fellows, M.R.
Series statement
Monographs in Computer Science,
http://library.link/vocab/subjectName
  • Information theory
  • Logic, Symbolic and mathematical
  • Mathematics
  • Combinatorics
  • Computer software
  • Theory of Computation
  • Mathematical Logic and Foundations
  • Applications of Mathematics
  • Combinatorics
  • Algorithm Analysis and Problem Complexity
Label
Parameterized Complexity, by Rodney G. Downey, M.R. Fellows, (electronic resource)
Instantiates
Publication
Note
"With 68 figures."
Antecedent source
mixed
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
  • cr
Color
not applicable
Content category
text
Content type code
  • txt
Contents
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 Connections Between Classical and Parameterized Complexity -- B.4 Classification Gaps -- B.5 Structural Issues and Analogs of Classical Results -- References
Dimensions
unknown
Edition
1st ed. 1999.
Extent
1 online resource (XV, 533 p.)
File format
multiple file formats
Form of item
online
Isbn
9781461205159
Level of compression
uncompressed
Media category
computer
Media type code
  • c
Other control number
10.1007/978-1-4612-0515-9
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
  • (CKB)3400000000089163
  • (SSID)ssj0000934735
  • (PQKBManifestationID)11520545
  • (PQKBTitleCode)TC0000934735
  • (PQKBWorkID)10931169
  • (PQKB)10569223
  • (DE-He213)978-1-4612-0515-9
  • (MiAaPQ)EBC3074976
  • (EXLCZ)993400000000089163
Label
Parameterized Complexity, by Rodney G. Downey, M.R. Fellows, (electronic resource)
Publication
Note
"With 68 figures."
Antecedent source
mixed
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
  • cr
Color
not applicable
Content category
text
Content type code
  • txt
Contents
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 Connections Between Classical and Parameterized Complexity -- B.4 Classification Gaps -- B.5 Structural Issues and Analogs of Classical Results -- References
Dimensions
unknown
Edition
1st ed. 1999.
Extent
1 online resource (XV, 533 p.)
File format
multiple file formats
Form of item
online
Isbn
9781461205159
Level of compression
uncompressed
Media category
computer
Media type code
  • c
Other control number
10.1007/978-1-4612-0515-9
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
  • (CKB)3400000000089163
  • (SSID)ssj0000934735
  • (PQKBManifestationID)11520545
  • (PQKBTitleCode)TC0000934735
  • (PQKBWorkID)10931169
  • (PQKB)10569223
  • (DE-He213)978-1-4612-0515-9
  • (MiAaPQ)EBC3074976
  • (EXLCZ)993400000000089163

Library Locations

  • Architecture LibraryBorrow it
    Gould Hall 830 Van Vleet Oval Rm. 105, Norman, OK, 73019, US
    35.205706 -97.445050
  • Bizzell Memorial LibraryBorrow it
    401 W. Brooks St., Norman, OK, 73019, US
    35.207487 -97.447906
  • Boorstin CollectionBorrow it
    401 W. Brooks St., Norman, OK, 73019, US
    35.207487 -97.447906
  • Chinese Literature Translation ArchiveBorrow it
    401 W. Brooks St., RM 414, Norman, OK, 73019, US
    35.207487 -97.447906
  • Engineering LibraryBorrow it
    Felgar Hall 865 Asp Avenue, Rm. 222, Norman, OK, 73019, US
    35.205706 -97.445050
  • Fine Arts LibraryBorrow it
    Catlett Music Center 500 West Boyd Street, Rm. 20, Norman, OK, 73019, US
    35.210371 -97.448244
  • Harry W. Bass Business History CollectionBorrow it
    401 W. Brooks St., Rm. 521NW, Norman, OK, 73019, US
    35.207487 -97.447906
  • History of Science CollectionsBorrow it
    401 W. Brooks St., Rm. 521NW, Norman, OK, 73019, US
    35.207487 -97.447906
  • John and Mary Nichols Rare Books and Special CollectionsBorrow it
    401 W. Brooks St., Rm. 509NW, Norman, OK, 73019, US
    35.207487 -97.447906
  • Library Service CenterBorrow it
    2601 Technology Place, Norman, OK, 73019, US
    35.185561 -97.398361
  • Price College Digital LibraryBorrow it
    Adams Hall 102 307 West Brooks St., Norman, OK, 73019, US
    35.210371 -97.448244
  • Western History CollectionsBorrow it
    Monnet Hall 630 Parrington Oval, Rm. 300, Norman, OK, 73019, US
    35.209584 -97.445414
Processing Feedback ...