|
|
 |
| Результат поиска |
Поиск книг, содержащих: Sipser, M.
| Книга | Страницы для поиска | | Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 1) | 1625, 2013; see “Furst, M.” | | Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 2) | 1625, 2013, see Furst, M. | | Bach E., Shallit J. — Algorithmic Number Theory (том 1) | 64, 310 | | Wicker S.B., Kim S. — Fundamentals of Codes, Graphs, and Iterative Decoding | xviii, 143, 148, 174, 215 | | Papadimitriou C.H. — Computational Complexity | 56, 179, 277, 296, 351, 353, 387, 393, 437, 487, 506 | | Motwani R., Raghavan P. — Randomized algorithms | 123, 188, 192 | | Li M., Vitanyi P. — An introduction to Kolmogorov complexity and its applications | 126, 151—153, 431, 482, 486, 516, 517 | | Lewis H.R., Papadimitriou C.H. — Elements of the Theory of Computation | 244 | | Habib M., McDiarmid C., Ramirez-Alfonsin J. (eds.) — Probabilistic Methods for Algorithmic Discrete Mathematics | 56, 72, 87, 88, 90 | | Du D.-Z., Ko K.-I. — Theory of computational complexity | 319, 352, 391 | | Shen A. — Algorithms and Programming | 212 |
|
|
|
|
О проекте