| 000 | 02805nam a22005415i 4500 | ||
|---|---|---|---|
| 001 | 978-3-642-30891-8 | ||
| 003 | DE-He213 | ||
| 005 | 20140220083320.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 120615s2012 gw | s |||| 0|eng d | ||
| 020 |
_a9783642308918 _9978-3-642-30891-8 |
||
| 024 | 7 |
_a10.1007/978-3-642-30891-8 _2doi |
|
| 050 | 4 | _aQA76.9.A43 | |
| 072 | 7 |
_aUMB _2bicssc |
|
| 072 | 7 |
_aCOM051300 _2bisacsh |
|
| 082 | 0 | 4 |
_a005.1 _223 |
| 100 | 1 |
_aBodlaender, Hans L. _eeditor. |
|
| 245 | 1 | 4 |
_aThe Multivariate Algorithmic Revolution and Beyond _h[electronic resource] : _bEssays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday / _cedited by Hans L. Bodlaender, Rod Downey, Fedor V. Fomin, Dániel Marx. |
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2012. |
|
| 300 |
_aXXII, 506p. 32 illus. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 490 | 1 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v7370 |
|
| 520 | _aParameterized complexity is currently a thriving field in complexity theory and algorithm design. A significant part of the success of the field can be attributed to Michael R. Fellows. This Festschrift published in honor of Mike Fellows on the occasion of his 60th birthday. It contains 20 papers that showcase the important scientific contributions of this remarkable man describes the history of the field of parameterized complexity, and also reflects on other parts of Mike Fellows’s unique and broad range of interests, including his work on the popularization of discrete mathematics for young children. The volume contains several surveys that introduce the reader to the field of parameterized complexity and discuss important notions, results, and developments in this field. | ||
| 650 | 0 | _aComputer science. | |
| 650 | 0 | _aComputer software. | |
| 650 | 0 | _aLogic design. | |
| 650 | 0 | _aComputational complexity. | |
| 650 | 1 | 4 | _aComputer Science. |
| 650 | 2 | 4 | _aAlgorithm Analysis and Problem Complexity. |
| 650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
| 650 | 2 | 4 | _aComputation by Abstract Devices. |
| 650 | 2 | 4 | _aMathematical Logic and Formal Languages. |
| 650 | 2 | 4 | _aLogics and Meanings of Programs. |
| 700 | 1 |
_aDowney, Rod. _eeditor. |
|
| 700 | 1 |
_aFomin, Fedor V. _eeditor. |
|
| 700 | 1 |
_aMarx, Dániel. _eeditor. |
|
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer eBooks | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783642308901 |
| 830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v7370 |
|
| 856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/978-3-642-30891-8 |
| 912 | _aZDB-2-SCS | ||
| 912 | _aZDB-2-LNC | ||
| 999 |
_c103269 _d103269 |
||