Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
 |
|
Описание:
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...Похожие книги
 | MCSE Windows 2000 Server Exam Cram2 (Exam 70-215) Автор: Tittel E., Stewart J.M., Schmied W. Год: 2003 |
| Quantum Groups, Quantum Categories And Quantum Field Theory Автор: Frohlich J. Год: 2008 |
| Fifty Challenging Problems in Probability with Solutions Автор: Mosteller F. Год: 1987 |
| Engineering Materials for Biomedical Applications Автор: Hin T.S. Год: 2004 |
| Powder Method in X-Ray Crystallography Автор: Leonid V. Azaroff, Buerger M.L. Год: 1958 |
| Combinatorial topology, Автор: Aleksandrov P.S. Год: 1956 |