|
|
 |
| Результат поиска |
Поиск книг, содержащих: Micali, S.
| Книга | Страницы для поиска | | Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 1) | 2033; see “Blum, M.” | | Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 2) | 1511, 1515, 1630, 2011, 2033, 2034, 2035, see Blum, M., see Goldreich, O., see Goldwasser, S. | | Grotschel M., Lovasz L., Schrijver A. — Geometric Algorithms and Combinatorial Optimization | 255, 342 | | Zimand M. — Computational Complexity: A Quantitative Perspective | 222, 223, 315 | | Shoup V.A. — Computational Introduction to Number Theory and Algebra | 298 | | Papadimitriou C.H. — Computational Complexity | 295, 296 | | Motwani R., Raghavan P. — Randomized algorithms | 187, 188 | | Papadimitriou C.H., Steiglitz K. — Combinatorial Optimization: Algorithms and Complexity | 246 | | Nishizeki T., Chiba N. — Planar Graphs: Theory and Algorithms (North-Holland Mathematics Studies) | 210, 213 | | Kozen D.C. — The Design And Analysis Of Algorithms | 107, 286 | | Attiya H., Welch J. — Distributed computing | 319 | | Habib M., McDiarmid C., Ramirez-Alfonsin J. (eds.) — Probabilistic Methods for Algorithmic Discrete Mathematics | 91, 112, 114 | | Gibbons A. — Algorithmic graph theory | 132, 148 | | Gibbons A. — Algorithmic graph theory | 132, 148 | | Du D.-Z., Ko K.-I. — Theory of computational complexity | 390, 391 |
|
|
|
|
О проекте