Fundamentals of Parameterized Complexity / Texts in Computer Science (PDF)
This comprehensive and...
48 DeutschlandCard Punkte sammeln
- Lastschrift, Kreditkarte, Paypal, Rechnung
- Kostenloser tolino webreader
The field of parameterized complexity/multivariate complexity algorithmics is an exciting and vibrant part of theoretical computer science, responding to the vital need for efficient algorithms in modern society.
This comprehensive and self-contained textbook presents an accessible overview of the state of the art of multivariate algorithmics and complexity. Increasingly, multivariate algorithmics is having significant practical impact in many application domains, with even more developments on the horizon. The text describes how the multivariate framework allows an extended dialog with a problem, enabling the reader who masters the complexity issues under discussion to use the positive and negative toolkits in their own research.
Topics and features:
- Describes many of the standard algorithmic techniques available for establishing parametric tractability
- Reviews the classical hardness classes
- Explores the various limitations and relaxations of the methods
- Showcases the powerful new lower bound techniques
- Examines various different algorithmic solutions to the same problems, highlighting the insights to be gained from each approach
- Demonstrates how complexity methods and ideas have evolved over the past 25 years
This classroom-tested and easy-to-follow textbook/reference is essential reading for the beginning graduate student and advanced undergraduate student. The book will also serve as an invaluable resource for the general computer scientist and the mathematically-aware scientist seeking tools for their research.
Dr. Michael R. Fellows is a Professor in the School of Engineering and Information Technology, at the Charles Darwin University, Darwin, NT, Australia.
- Autoren: Rodney G. Downey , Michael R. Fellows
- 2013, 2013, 763 Seiten, Englisch
- Verlag: Springer-Verlag GmbH
- ISBN-10: 1447155599
- ISBN-13: 9781447155591
- Erscheinungsdatum: 03.12.2013
Abhängig von Bildschirmgröße und eingestellter Schriftgröße kann die Seitenzahl auf Ihrem Lesegerät variieren.
- Dateiformat: PDF
- Größe: 7.85 MB
- Mit Kopierschutz
- Vorlesefunktion
“It can be read by graduate students who have some background in computational complexity. … I strongly recommend Fundamentals of Parameterized Complexity for all researchers in theoretical computer science. … It is my belief that this book is now the definitive text on parameterized complexity, both for the breadth and depth of material covered and also for including the latest developments in the field (as recently as 2012).” (Rajesh Chitnis, SIGACT News, Vol. 46 (1), 2015)“This book is currently the only monograph that covers lower bounds in kernelization or parameterized approximation. … this new volume could serve as a (relatively easily) accessible source for a researcher in the area as well as helping students find their way into this interesting field. … nearly 700 citations and a well-designed index help to navigate through the book and through the literature.” (Henning Fernau, Mathematical Reviews, November, 2014)
Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
---|
Schreiben Sie einen Kommentar zu "Fundamentals of Parameterized Complexity / Texts in Computer Science".
Kommentar verfassen