|
|
|
|
| LEADER |
02907nam a22005655i 4500 |
| 001 |
978-3-642-30891-8 |
| 003 |
DE-He213 |
| 005 |
20170119113144.0 |
| 007 |
cr nn 008mamaa |
| 008 |
120615s2012 gw | s |||| 0|eng d |
| 020 |
|
|
|a 9783642308918
|9 978-3-642-30891-8
|
| 024 |
7 |
|
|a 10.1007/978-3-642-30891-8
|2 doi
|
| 040 |
|
|
|d GrThAP
|
| 050 |
|
4 |
|a QA76.9.A43
|
| 072 |
|
7 |
|a UMB
|2 bicssc
|
| 072 |
|
7 |
|a COM051300
|2 bisacsh
|
| 082 |
0 |
4 |
|a 005.1
|2 23
|
| 245 |
1 |
4 |
|a The Multivariate Algorithmic Revolution and Beyond
|h [electronic resource] :
|b Essays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday /
|c edited by Hans L. Bodlaender, Rod Downey, Fedor V. Fomin, Dániel Marx.
|
| 264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2012.
|
| 300 |
|
|
|a XXII, 506 p. 32 illus.
|b online resource.
|
| 336 |
|
|
|a text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a computer
|b c
|2 rdamedia
|
| 338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
| 347 |
|
|
|a text file
|b PDF
|2 rda
|
| 490 |
1 |
|
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 7370
|
| 520 |
|
|
|a Parameterized 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 |
|a Computer science.
|
| 650 |
|
0 |
|a Computers.
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
|
0 |
|a Computer logic.
|
| 650 |
|
0 |
|a Mathematical logic.
|
| 650 |
|
0 |
|a Computer science
|x Mathematics.
|
| 650 |
1 |
4 |
|a Computer Science.
|
| 650 |
2 |
4 |
|a Algorithm Analysis and Problem Complexity.
|
| 650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|
| 650 |
2 |
4 |
|a Computation by Abstract Devices.
|
| 650 |
2 |
4 |
|a Mathematical Logic and Formal Languages.
|
| 650 |
2 |
4 |
|a Logics and Meanings of Programs.
|
| 700 |
1 |
|
|a Bodlaender, Hans L.
|e editor.
|
| 700 |
1 |
|
|a Downey, Rod.
|e editor.
|
| 700 |
1 |
|
|a Fomin, Fedor V.
|e editor.
|
| 700 |
1 |
|
|a Marx, Dániel.
|e editor.
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783642308901
|
| 830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 7370
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-642-30891-8
|z Full Text via HEAL-Link
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (Springer-11645)
|
