Cantitate/Preț
Produs
Total produse
Vezi coșul
Fundamentals of Parameterized Complexity de Rodney G. Downey

Fundamentals of Parameterized Complexity: Texts in Computer Science

Autor Rodney G. Downey, Michael R. Fellows
en Limba Engleză Hardback – 17 dec 2013
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. 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.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 57031 lei  38-44 zile
  SPRINGER LONDON – 27 aug 2016 57031 lei  38-44 zile
Hardback (1) 72693 lei  38-44 zile
  SPRINGER LONDON – 17 dec 2013 72693 lei  38-44 zile

Din seria Texts in Computer Science

Preț: 72693 lei

Preț vechi: 94407 lei
-23% Nou

Puncte Express: 1090
Preț estimativ în valută:
13912€ • 14451$ • 11556£

Carte tipărită la comandă

Livrare economică 29 ianuarie-04 februarie 25

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9781447155584
ISBN-10: 1447155580
Pagini: 796
Ilustrații: XXX, 763 p. 83 illus.
Dimensiuni: 155 x 235 x 48 mm
Greutate: 1.28 kg
Ediția:2013
Editura: SPRINGER LONDON
Colecția Springer
Seria Texts in Computer Science

Locul publicării:London, United Kingdom

Public țintă

Upper undergraduate

Cuprins

Introduction.- Part I: Parameterized Tractability.- Preliminaries.- The Basic Definitions.- Part II: Elementary Positive Techniques.- Bounded Search Trees.- Kernelization.- More on Kernelization.- Iterative Compression, and Measure and Conquer, for Minimization Problems.- Further Elementary Techniques.- Colour Coding, Multilinear Detection, and Randomized Divide and Conquer.- Optimization Problems, Approximation Schemes, and Their Relation to FPT.- Part III: Techniques Based on Graph Structure.- Treewidth and Dynamic Programming.- Heuristics for Treewidth.- Automata and Bounded Treewidth.- Courcelle's Theorem.- More on Width-Metrics: Applications and Local Treewidth.- Depth-First Search and the Plehn-Voigt Theorem.- Other Width Metrics.- Part IV: Exotic Meta-Techniques.- Well-Quasi-Orderings and the Robertson-Seymour Theorems.- The Graph Minor Theorem.- Applications of the Obstruction Principle and WQOs.- Part V: Hardness Theory.- Reductions.- TheBasic Class W[1] and an Analog of Cook's Theorem.- Other Hardness Results.- The W-Hierarchy.- The Monotone and Antimonotone Collapses.- Beyond W-Hardness.- k-Move Games.- Provable Intractability: The Class XP.- Another Basis.- Part VI: Approximations, Connections, Lower Bounds.- The M-Hierarchy, and XP-optimality.- Kernelization Lower Bounds.- Part VII: Further Topics.- Parameterized Approximation.- Parameterized Counting and Randomization.- Part VIII: Research Horizons.- Research Horizons.- Part IX Appendices.- Appendix 1: Network Flows and Matchings.- Appendix 2: Menger's Theorems.

Recenzii

“It is a new book that conveys a detailed picture of parameterized complexity as it stands today. … The writing style is direct and engaging, allowing the reader to quickly grasp the core ideas for each topic. The book coverage is comprehensive, including even relatively recent results, and manages to give a rich representation of the current state of the field. In short, this is an excellent book that will serve well anyone interested in algorithm design and complexity.” (Marius Zimand, zbMATH 1358.68006, 2017)
“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 breadthand 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)

Notă biografică

Dr. Rodney G. Downey is a Professor in the School of Mathematics, Statistics and Operations Research, at the Victoria University of Wellington, New Zealand.
Dr. Michael R. Fellows is a Professor in the School of Engineering and Information Technology, at the Charles Darwin University, Darwin, NT, Australia.

Textul de pe ultima copertă

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.

Caracteristici

Presents an accessible overview of the state of the art of multivariate algorithmics and complexity Describes the wealth of recent techniques for proving parameterized tractability Showcases the powerful new lower bound techniques Includes supplementary material: sn.pub/extras