分享给好友:
Randomness and Completeness in Computational Complexity - Lecture Notes in Computer Science Dieter Van Melkebeek 2000 edition
Randomness and Completeness in Computational Complexity - Lecture Notes in Computer Science
Dieter Van Melkebeek
This text, based on the author's competition-winning PhD thesis, studies central issues in computational complexity: the relative power of time, space, and randomness in computing and verification. He presents approaches based on such concepts as density, redundancy, and frequency of occurrence.
198 pages, biography
| 介质类型 | 图书 Paperback Book (平装胶订图书) |
| 已发行 | 2000年12月13日 |
| ISBN13 | 9783540414926 |
| 出版商 | Springer-Verlag Berlin and Heidelberg Gm |
| 页数 | 198 |
| 商品尺寸 | 156 × 234 × 11 mm · 312 g |
| 语言 | 英语 |