| 000 | 03263nam a22006135i 4500 | ||
|---|---|---|---|
| 001 | 978-3-642-30891-8 | ||
| 003 | DE-He213 | ||
| 005 | 20240423125632.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 |
|
| 072 | 7 |
_aUMB _2thema |
|
| 082 | 0 | 4 |
_a518.1 _223 |
| 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, Rodney Downey, Fedor V. Fomin, Dániel Marx. |
| 250 | _a1st ed. 2012. | ||
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2012. |
|
| 300 |
_aXXII, 506 p. 32 illus. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 490 | 1 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _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 | _aAlgorithms. | |
| 650 | 0 |
_aComputer science _xMathematics. |
|
| 650 | 0 | _aDiscrete mathematics. | |
| 650 | 0 | _aComputer science. | |
| 650 | 0 | _aMachine theory. | |
| 650 | 1 | 4 | _aAlgorithms. |
| 650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
| 650 | 2 | 4 | _aTheory of Computation. |
| 650 | 2 | 4 | _aFormal Languages and Automata Theory. |
| 650 | 2 | 4 | _aComputer Science Logic and Foundations of Programming. |
| 700 | 1 |
_aBodlaender, Hans L. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
| 700 | 1 |
_aDowney, Rodney. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
| 700 | 1 |
_aFomin, Fedor V. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
| 700 | 1 |
_aMarx, Dániel. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer Nature eBook | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783642308901 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783642308925 |
| 830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v7370 |
|
| 856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-642-30891-8 |
| 912 | _aZDB-2-SCS | ||
| 912 | _aZDB-2-SXCS | ||
| 912 | _aZDB-2-LNC | ||
| 942 | _cSPRINGER | ||
| 999 |
_c180107 _d180107 |
||