| 書目名稱 | The Complexity Theory Companion |
| 編輯 | Lane A. Hemaspaandra,Mitsunori Ogihara |
| 視頻video | http://file.papertrans.cn/907/906521/906521.mp4 |
| 概述 | Offers an algorithmic approach to computational complexity.Intuitive approach makes this field more easily and fully accessible to readers at all levels.Includes supplementary material: |
| 叢書名稱 | Texts in Theoretical Computer Science. An EATCS Series |
| 圖書封面 |  |
| 描述 | .The Complexity Theory Companion is an accessible, algorithmically oriented, research-centered, up-to-date guide to some of the most interesting techniques of complexity theory..The book‘s thesis is that simple algorithms are at the heart of complexity theory. From the tree-pruning and interval-pruning algorithms that shape the first chapter to the query simulation procedures that dominate the last chapter, the central proof methods of the book are algorithmic. And to more clearly highlight the role of algorithmic techniques in complexity theory, the book is - unlike other texts on complexity - organized by technique rather than by topic. Each chapter of this book focuses on one technique: what it is, and what results and applications it yields..This textbook was developed at the University of Rochester in courses given to graduate students and advanced undergraduates. Researchers also will find this book a valuable source of reference due to the comprehensive bibliography of close to five hundred entries, the thirty-five page subject index, and the appendices giving overviews of complexity classes and reductions. |
| 出版日期 | Textbook 2002 |
| 關(guān)鍵詞 | Complexity Theory; Computational Complexity; Foundations; Graph; Sim; Theoretical Computer Science; Theory |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-3-662-04880-1 |
| isbn_softcover | 978-3-642-08684-7 |
| isbn_ebook | 978-3-662-04880-1Series ISSN 1862-4499 Series E-ISSN 1862-4502 |
| issn_series | 1862-4499 |
| copyright | Springer-Verlag Berlin Heidelberg 2002 |
|Archiver|手機(jī)版|小黑屋|
派博傳思國(guó)際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-8 11:16
發(fā)表于 2025-3-21 16:39:36
