| 書目名稱 | Parameterized Complexity Theory |
| 編輯 | J?rg Flum,Martin Grohe |
| 視頻video | http://file.papertrans.cn/742/741149/741149.mp4 |
| 概述 | The previous definitive book on the area was the Springer title "Parameterized Complexity" by Downey and Fellows, which is now 6 years old..There are many important new results in the area to introduc |
| 叢書名稱 | 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 to computer scientists, mathematicians and graduate students engaged with algorithms and problem complexity.. |
| 出版日期 | Textbook 2006 |
| 關(guān)鍵詞 | Algorithms; Automat; algorithm; automata; complexity; complexity theory; computer; logic; programming; algori |
| 版次 | 1 |
| doi | https://doi.org/10.1007/3-540-29953-X |
| isbn_softcover | 978-3-642-06757-0 |
| isbn_ebook | 978-3-540-29953-0Series ISSN 1862-4499 Series E-ISSN 1862-4502 |
| issn_series | 1862-4499 |
| copyright | Springer-Verlag Berlin Heidelberg 2006 |
|Archiver|手機(jī)版|小黑屋|
派博傳思國(guó)際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-28 02:06
發(fā)表于 2025-3-21 17:49:12
