Cantitate/Preț
Produs

The Multivariate Algorithmic Revolution and Beyond: Essays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday: Lecture Notes in Computer Science, cartea 7370

Editat de Hans L. Bodlaender, Rodney Downey, Fedor V. Fomin, Dániel Marx
en Limba Engleză Paperback – 31 mai 2012
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 has been 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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32713 lei

Preț vechi: 40891 lei
-20% Nou

Puncte Express: 491

Preț estimativ în valută:
6262 6733$ 5220£

Carte tipărită la comandă

Livrare economică 19 decembrie 24 - 02 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783642308901
ISBN-10: 3642308902
Pagini: 528
Ilustrații: XXII, 506 p. 32 illus.
Dimensiuni: 155 x 235 x 28 mm
Greutate: 0.77 kg
Ediția:2012
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Fixed-Parameter Tractability, A Prehistory.- The Birth and Early Years of Parameterized Complexity.- Crypto Galore!.- Flyby: Life Before, During, and After Graduate Studies with Mike Fellows.- The Impact of Parameterized Complexity to Interdisciplinary Problem Solving.- Vertex Cover, Dominating Set and My Encounters with Parameterized Complexity and Mike Fellows.- Mike Fellows: Weaving the Web of Mathematics and Adventure.- Passion Plays: Melodramas about Mathematics.- A Basic Parameterized Complexity Primer.- Kernelization – Preprocessing with a Guarantee.- Parameterized Complexity and Subexponential-Time Computability.- Fixed-Parameter Tractability of Treewidth and Pathwidth.- Graph Minors and Parameterized Algorithm Design.- Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey.- Backdoors to Satisfaction.- Studies in Computational Aspects of Voting: A Parameterized Complexity Perspective.- A Parameterized Halting Problem.- Computer Science Unplugged and Related Projects in Math and Computer Science Popularization.- FPT Suspects and Tough Customers: Open Problems of Downey and Fellows.- What’s Next? Future Directions in Parameterized Complexity.

Textul de pe ultima copertă

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.

Caracteristici

Features classical research papers reflecting the breadth of the work and influence of Michael R. Fellows Commemorative publication Written by experts