| 书目名称 | Randomness and Completeness in Computational Complexity |
| 编辑 | Dieter Melkebeek |
| 视频video | |
| 概述 | Includes supplementary material: |
| 丛书名称 | Lecture Notes in Computer Science |
| 图书封面 |  |
| 描述 | This book contains a revised version of the dissertation the author wrote at the Department of Computer Science of the University of Chicago. The thesis was submitted to the Faculty of Physical Sciences in conformity with the requirements for the PhD degree in June 1999. It was honored with the 1999 ACM Doctoral Dissertation Award in May 2000. Summary Computational complexity is the study of the inherent di culty of compu- tional problems and the power of the tools we may use to solve them. It aims to describe how many resources we need to compute the solution as a function of the problem size. Typical resources include time on sequential and parallel architectures and memory space. As we want to abstract away from details of input representation and speci cs of the computer model, we end up with classes of problems that we can solve within certain robust resource bounds such as polynomial time, parallel logarithmic time, and logarithmic space. Research in complexity theory boils down to determining the relationships between these classes { inclusions and separations. In this dissertation, we focus on the role of randomness and look at various properties of hard problems in order t |
| 出版日期 | Book 2000 |
| 关键词 | Algorithms; Complete Languages; Completeness; Complexity Theory; Computational Complexity; Formal Languag |
| 版次 | 1 |
| doi | https://doi.org/10.1007/3-540-44545-5 |
| isbn_softcover | 978-3-540-41492-6 |
| isbn_ebook | 978-3-540-44545-6Series ISSN 0302-9743 Series E-ISSN 1611-3349 |
| issn_series | 0302-9743 |
| copyright | Springer-Verlag Berlin Heidelberg 2000 |
发表于 2025-3-21 16:34:26
