![Parameterized Complexity [electronic resource] /](/search/themes/bootstrap3/images/libros.png)
Parameterized Complexity [electronic resource] /
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.
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Texto biblioteca |
| Language: | eng |
| Published: |
New York, NY : Springer New York : Imprint: Springer,
1999
|
| Subjects: | Computer science., Computers., Algorithms., Applied mathematics., Engineering mathematics., Mathematical logic., Combinatorics., Computer Science., Theory of Computation., Mathematical Logic and Foundations., Applications of Mathematics., Algorithm Analysis and Problem Complexity., |
| Online Access: | http://dx.doi.org/10.1007/978-1-4612-0515-9 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| id |
KOHA-OAI-TEST:191615 |
|---|---|
| record_format |
koha |
| institution |
COLPOS |
| collection |
Koha |
| country |
México |
| countrycode |
MX |
| component |
Bibliográfico |
| access |
En linea En linea |
| databasecode |
cat-colpos |
| tag |
biblioteca |
| region |
America del Norte |
| libraryname |
Departamento de documentación y biblioteca de COLPOS |
| language |
eng |
| topic |
Computer science. Computers. Algorithms. Applied mathematics. Engineering mathematics. Mathematical logic. Combinatorics. Computer Science. Theory of Computation. Mathematical Logic and Foundations. Applications of Mathematics. Combinatorics. Algorithm Analysis and Problem Complexity. Computer science. Computers. Algorithms. Applied mathematics. Engineering mathematics. Mathematical logic. Combinatorics. Computer Science. Theory of Computation. Mathematical Logic and Foundations. Applications of Mathematics. Combinatorics. Algorithm Analysis and Problem Complexity. |
| spellingShingle |
Computer science. Computers. Algorithms. Applied mathematics. Engineering mathematics. Mathematical logic. Combinatorics. Computer Science. Theory of Computation. Mathematical Logic and Foundations. Applications of Mathematics. Combinatorics. Algorithm Analysis and Problem Complexity. Computer science. Computers. Algorithms. Applied mathematics. Engineering mathematics. Mathematical logic. Combinatorics. Computer Science. Theory of Computation. Mathematical Logic and Foundations. Applications of Mathematics. Combinatorics. Algorithm Analysis and Problem Complexity. Downey, R. G. author. Fellows, M. R. author. SpringerLink (Online service) Parameterized Complexity [electronic resource] / |
| description |
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. |
| format |
Texto |
| topic_facet |
Computer science. Computers. Algorithms. Applied mathematics. Engineering mathematics. Mathematical logic. Combinatorics. Computer Science. Theory of Computation. Mathematical Logic and Foundations. Applications of Mathematics. Combinatorics. Algorithm Analysis and Problem Complexity. |
| author |
Downey, R. G. author. Fellows, M. R. author. SpringerLink (Online service) |
| author_facet |
Downey, R. G. author. Fellows, M. R. author. SpringerLink (Online service) |
| author_sort |
Downey, R. G. author. |
| title |
Parameterized Complexity [electronic resource] / |
| title_short |
Parameterized Complexity [electronic resource] / |
| title_full |
Parameterized Complexity [electronic resource] / |
| title_fullStr |
Parameterized Complexity [electronic resource] / |
| title_full_unstemmed |
Parameterized Complexity [electronic resource] / |
| title_sort |
parameterized complexity [electronic resource] / |
| publisher |
New York, NY : Springer New York : Imprint: Springer, |
| publishDate |
1999 |
| url |
http://dx.doi.org/10.1007/978-1-4612-0515-9 |
| work_keys_str_mv |
AT downeyrgauthor parameterizedcomplexityelectronicresource AT fellowsmrauthor parameterizedcomplexityelectronicresource AT springerlinkonlineservice parameterizedcomplexityelectronicresource |
| _version_ |
1756266218593976320 |
| spelling |
KOHA-OAI-TEST:1916152018-07-30T23:16:16ZParameterized Complexity [electronic resource] / Downey, R. G. author. Fellows, M. R. author. SpringerLink (Online service) textNew York, NY : Springer New York : Imprint: Springer,1999.engThe 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.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.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.Computer science.Computers.Algorithms.Applied mathematics.Engineering mathematics.Mathematical logic.Combinatorics.Computer Science.Theory of Computation.Mathematical Logic and Foundations.Applications of Mathematics.Combinatorics.Algorithm Analysis and Problem Complexity.Springer eBookshttp://dx.doi.org/10.1007/978-1-4612-0515-9URN:ISBN:9781461205159 |