|
|
 |
| Результат поиска |
Поиск книг, содержащих: Wigderson, A.
| Книга | Страницы для поиска | | Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 1) | 246 | | Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 2) | 246, 1511, 1515, 1557, 1590, 2017, 2035, see Goldreich, O., see Karchmer, M., see Limal, N. | | Zimand M. — Computational Complexity: A Quantitative Perspective | 223, 315 | | Allouche J.-P., Shallit J. — Automatic Sequences: Theory, Applications, Generalizations | 437 | | Papadimitriou C.H. — Computational Complexity | 296, 394, 408, 500 | | Motwani R., Raghavan P. — Randomized algorithms | 24, 41, 123, 156, 187, 188, 361, 362, 366, 387 | | Li M., Vitanyi P. — An introduction to Kolmogorov complexity and its applications | 447, 453, 456 | | Du D. (ed.), Pardalos P. (ed.) — Handbook of combinatorial optimization: supplement volume A | 41, 48, 63 | | Sack J.R., Urrutia J. (Ed) — Handbook of Computational Geometry | 566, 569, 593 [77], 595 [122] | | Kozen D.C. — The Design And Analysis Of Algorithms | 191 | | Habib M., McDiarmid C., Ramirez-Alfonsin J. (eds.) — Probabilistic Methods for Algorithmic Discrete Mathematics | 101, 113, 114 | | Du D.-Z., Ko K.-I. — Theory of computational complexity | 319, 391 | | Yovits M. — Advances in Computers.Volume 26. | 128, 129, 151 |
|
|
|
|
О проекте