| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISA996465310703316 |
|
|
Titolo |
The Multivariate Algorithmic Revolution and Beyond [[electronic resource] ] : Essays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday / / edited by Hans L. Bodlaender, Rodney Downey, Fedor V. Fomin, Dániel Marx |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2012.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (XXII, 506 p. 32 illus.) |
|
|
|
|
|
|
Collana |
|
Theoretical Computer Science and General Issues, , 2512-2029 ; ; 7370 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Algorithms |
Computer science—Mathematics |
Discrete mathematics |
Computer science |
Machine theory |
Discrete Mathematics in Computer Science |
Theory of Computation |
Formal Languages and Automata Theory |
Computer Science Logic and Foundations of Programming |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references and author index. |
|
|
|
|
|
|
Sommario/riassunto |
|
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. |
|
|
|
|
|
| |