Parameterized Complexity Theory
Parameterized Complexity Theory by Jörg Flum
English | PDF | 2006 | 495 Pages | ISBN : 3540299521 | 4.2 MB
Parameterized complexity theory is a recent branch of computational complexity theory that provides a framework for a refined analysis of hard algorithmic problems. The central notion of the theory, fixed-parameter tractability, has led to the development of various new algorithmic techniques and a whole new theory of intractability.
This book is a state-of-the-art introduction to both algorithmic techniques for fixed-parameter tractability and the structural theory of parameterized complexity classes, and it presents detailed proofs of recent advanced results that have not appeared in book form before. Several chapters are each devoted to intractability, algorithmic techniques for designing fixed-parameter tractable algorithms, and bounded fixed-parameter tractability and subexponential time complexity. The treatment is comprehensive, and the reader is supported with exercises, notes, a detailed index, and some background on complexity theory and logic.
The book will be of interest to computer scientists, mathematicians and graduate students engaged with algorithms and problem complexity.
Buy Premium From My Links To Get Resumable Support,Max Speed & Support Me
Significant surge in the popularity of free ebook download platforms. These virtual repositories offer an unparalleled range, covering genres that span from classic literature to contemporary non-fiction, and everything in between. Enthusiasts of reading can easily indulge in their passion by accessing free books download online services, which provide instant access to a wealth of knowledge and stories without the physical constraints of space or the financial burden of purchasing hardcover editions.
Comments (0)
Users of Guests are not allowed to comment this publication.