|
|
 |
| Результат поиска |
Поиск книг, содержащих: Fortnow, L.
| Книга | Страницы для поиска | | Zimand M. — Computational Complexity: A Quantitative Perspective | 223, 315 | | Papadimitriou C.H. — Computational Complexity | 352, 452, 488, 506, 507 | | Motwani R., Raghavan P. — Randomized algorithms | 188, 192 | | Li M., Vitanyi P. — An introduction to Kolmogorov complexity and its applications | 117, 456, 485, 499—501, 517, 518 | | Du D.-Z., Ko K.-I. — Theory of computational complexity | 243, 352, 390, 391, 450 | | Farach-Colton M. — Proceedings of the 14th Annual Acm-Siam Symposium on Discrete Algorithms | 480, 813 | | Farach-Colton M. — Proceedings of the Fourteenth Annual Acm-Siam Symposium on Discrete Algorithms | 480, 813 | | Fulop Z., Gecseg F. — Automata, Languages and Programming, 22 conf., ICALP95 | 558 | | Zelkowitz M. — Advances in Computers, Volume 55 | 183 |
|
|
|
|
О проекте