|
|
 |
| Результат поиска |
Поиск книг, содержащих: Babai, L.
| Книга | Страницы для поиска | | Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 1) | 64, 469, 627, 709, 956, 1236, 1357, 1449, 1454, 1458—1460, 1462, 1470, 1474, 1475, 1482—1486, 1489, 1493, 1494, 1496, 1497, 1499—1503, 1511—1520, 1522, 1630, 2005, 2007, 2010, 2054, 2057; see “Beals, R.” | | Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 2) | 64, 469, 627, 709, 956, 1236, 1357, 1449, 1454, 1458—1460, 1462, 1470, 1474, 1475, 1482—1486, 1484, 1489, 1493, 1494, 1496, 1497, 1499—1503, 1519, 1520, 1511—1520, 1522, 1630, 2005, 2007, 2010, 2054, 2057; see Beals, R. | | Bach E., Shallit J. — Algorithmic Number Theory (том 1) | 65 | | Grotschel M., Lovasz L., Schrijver A. — Geometric Algorithms and Combinatorial Optimization | 149, 195, 331 | | Zimand M. — Computational Complexity: A Quantitative Perspective | 223, 315 | | Holt D.F., Bettina E., Eamonn O. — Handbook of Computational Group Theory | 65, 69, 272 | | Erdos P. — Old and new problems and results in combinatorial number theory | 15 | | Bollobas B. — Modern Graph Theory | 293 | | Finch S.R. — Mathematical constants | 292, 320 | | Papadimitriou C.H. — Computational Complexity | 296, 452, 507 | | Motwani R., Raghavan P. — Randomized algorithms | 24, 187, 188, 361 | | Du D. (ed.), Pardalos P. (ed.) — Handbook of combinatorial optimization: supplement volume A | 30, 48 | | Sack J.R., Urrutia J. (Ed) — Handbook of Computational Geometry | 569, 590 [2] | | Kozen D.C. — The Design And Analysis Of Algorithms | 191 | | Zong Ch. — Sphere packings | 40 | | Association for Computing Machinery, Society for Industrial and Applied Mathematics — Proceedings of the Eighteenth Annual ACM-Siam Symposium on Discrete Algorithms | 627 | | Faith C. — Rings and Things and a Fine Array of Twentieth Century Associative Algebra | 290n | | Proceedings of the 19th annual ACM-SIAM symposium on discrete algorithms | 248 | | Habib M., McDiarmid C., Ramirez-Alfonsin J. (eds.) — Probabilistic Methods for Algorithmic Discrete Mathematics | 46, 51, 87 | | Du D.-Z., Ko K.-I. — Theory of computational complexity | 352, 390, 450 | | Gabow H. — Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Proceedings in Applied Mathematics) | 627 |
|
|
|
|
О проекте