|
|
 |
| Результат поиска |
Поиск книг, содержащих: Borodin, A.
| Книга | Страницы для поиска | | Тихомиров В.М. (ред.) — Международный конгресс математиков в Беркли 1986 г. | 237 | | Bach E., Shallit J. — Algorithmic Number Theory (том 1) | 65, 121, 149, 151, 152 | | Zimand M. — Computational Complexity: A Quantitative Perspective | 49 | | Finch S.R. — Mathematical constants | 386 | | Papadimitriou C.H. — Computational Complexity | 155, 405, 408 | | Motwani R., Raghavan P. — Randomized algorithms | 96, 155, 362, 387 | | Sedgewick R. — Algorithms | 88 | | Трауб Дж., Васильковский Г., Вожьняковский Х. — Информация, неопределенность, сложность | 76, 173 | | Sack J.R., Urrutia J. (Ed) — Handbook of Computational Geometry | 194 [58] | | Aho A.V., Ullman J.D. — The Theory of Parsing, Translation, and Compiling, Volume 1: Parsing | 36 | | Kozen D.C. — The Design And Analysis Of Algorithms | 178 | | Attiya H., Welch J. — Distributed computing | 368 | | Habib M., McDiarmid C., Ramirez-Alfonsin J. (eds.) — Probabilistic Methods for Algorithmic Discrete Mathematics | 113 | | Hopcroft J.E., Ullman J.D. — Introduction to automata theory, languages, and computation | 319 | | Aho A.V., Ullman J.D. — The Theory of Parsing, Translation, and Compiling. Volume II: Compiling | 36 | | Du D.-Z., Ko K.-I. — Theory of computational complexity | 242, 243, 277 |
|
|
|
|
О проекте