| 書目名稱 | Perspectives in Computational Complexity |
| 副標題 | The Somenath Biswas |
| 編輯 | Manindra Agrawal,Vikraman Arvind |
| 視頻video | http://file.papertrans.cn/745/744721/744721.mp4 |
| 概述 | Accessible and self-contained text addressing both graduate students and researchers.Two introductory chapters provide basic background material.Leads the reader to research level questions in various |
| 叢書名稱 | Progress in Computer Science and Applied Logic |
| 圖書封面 |  |
| 描述 | This book brings together contributions by leading researchers in computational complexity theory written in honor of Somenath Biswas on the occasion of his sixtieth birthday. They discuss current trends and exciting developments in this flourishing area of research and offer fresh perspectives on various aspects of complexity theory. The topics covered include arithmetic circuit complexity, lower bounds and polynomial identity testing, the isomorphism conjecture, space-bounded computation, graph isomorphism, resolution and proof complexity, entropy and randomness. Several chapters have a tutorial flavor. The aim is to make recent research in these topics accessible to graduate students and senior undergraduates in computer science and mathematics. It can also be useful as a resource for teaching advanced level courses in computational complexity. |
| 出版日期 | Book 2014 |
| 關鍵詞 | arithmetic circuits; complete sets; information theory; lower bounds; space and time complexity classes |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-3-319-05446-9 |
| isbn_softcover | 978-3-319-35058-5 |
| isbn_ebook | 978-3-319-05446-9Series ISSN 2297-0576 Series E-ISSN 2297-0584 |
| issn_series | 2297-0576 |
| copyright | Springer International Publishing Switzerland 2014 |
|Archiver|手機版|小黑屋|
派博傳思國際
( 京公網安備110108008328)
GMT+8, 2025-11-2 08:40
發(fā)表于 2025-3-21 20:04:40
