| 書(shū)目名稱(chēng) | Fundamentals of Parameterized Complexity |
| 編輯 | Rodney G. Downey,Michael R. Fellows |
| 視頻video | http://file.papertrans.cn/351/350452/350452.mp4 |
| 概述 | 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 power |
| 叢書(shū)名稱(chēng) | Texts in Computer Science |
| 圖書(shū)封面 |  |
| 描述 | 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. |
| 出版日期 | Textbook 2013 |
| 關(guān)鍵詞 | Computational Complexity; Graph Theory; Hardness Theory; Kernelization; Lower Bounds; Multivariate Algori |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-1-4471-5559-1 |
| isbn_softcover | 978-1-4471-7164-5 |
| isbn_ebook | 978-1-4471-5559-1Series ISSN 1868-0941 Series E-ISSN 1868-095X |
| issn_series | 1868-0941 |
| copyright | Springer-Verlag London 2013 |
|Archiver|手機(jī)版|小黑屋|
派博傳思國(guó)際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-15 01:48
發(fā)表于 2025-3-21 19:03:17
