| 書目名稱 | Complexity Theory Retrospective | | 副標(biāo)題 | In Honor of Juris Ha | | 編輯 | Alan L. Selman | | 視頻video | http://file.papertrans.cn/232/231653/231653.mp4 | | 圖書封面 |  | | 描述 | In 1965 Juris Hartmanis and Richard E. Stearns published a paper "On the Computational Complexity of Algorithms". The field of complexity theory takes its name from this seminal paper and many of the major concepts and issues of complexity theory were introduced by Hartmanis in subsequent work. In honor of the contribution of Juris Hartmanis to the field of complexity theory, a special session of invited talks by Richard E. Stearns, Allan Borodin and Paul Young was held at the third annual meeting of the Structure in Complexity conference, and the first three chapters of this book are the final versions of these talks. They recall intellectual and professional trends in Hartmanis‘ contributions. All but one of the remainder of the chapters in this volume originated as a presentation at one of the recent meetings of the Structure in Complexity Theory Conference and appeared in preliminary form in the conference proceedings. In all, these expositions form an excellent description of much of contemporary complexity theory. | | 出版日期 | Book 1990 | | 關(guān)鍵詞 | Counting; algorithm; algorithms; complexity; complexity theory; theory of computation; algorithm analysis | | 版次 | 1 | | doi | https://doi.org/10.1007/978-1-4612-4478-3 | | isbn_softcover | 978-1-4612-8793-3 | | isbn_ebook | 978-1-4612-4478-3 | | copyright | Springer-Verlag New York Inc. 1990 |
The information of publication is updating
|
|
|Archiver|手機(jī)版|小黑屋|
派博傳思國(guó)際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-20 01:08
發(fā)表于 2025-3-21 19:41:34
