|
|
 |
| Результат поиска |
Поиск книг, содержащих: Garey, M.R.
| Книга | Страницы для поиска | | Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 1) | 1552; see “Cofftnan, Jr. E.G.” | | Cameron P.J. — Combinatorics : Topics, Techniques, Algorithms | 329 | | Rips J.L. — The psychology of proof: deductive reasoning in human thinking | 67 | | Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 2) | 14, 246, 247, 315, 326, 910, 953, 956, 1511, 1551, 1552, 1601, 1632, 1634, 1998, 1999; see Coffman, Jr.E.G. | | Bach E., Shallit J. — Algorithmic Number Theory (том 1) | xiii, 64 | | Grotschel M., Lovasz L., Schrijver A. — Geometric Algorithms and Combinatorial Optimization | 21, 28, 219, 272, 336 | | Lawler E.L. — Combinatorial Optimization: Networks and Matroids | 299 | | Papadimitriou C.H. — Computational Complexity | 172, 174, 176, 177, 181, 182, 207, 209, 212, 215, 216, 327, 487 | | Hopcroft J.E., Motwani R., Ullman J.D. — Introduction to Automata Theory, Languages, and Computation | 468 | | Samet H. — Applications of Spatial Data Structures: Computer Graphics, Image Processing, and Other Areas | 11—12, 26, 444 | | Sedgewick R. — Algorithms | 536 | | Li M., Vitanyi P. — An introduction to Kolmogorov complexity and its applications | 86 | | Du D. (ed.), Pardalos P. (ed.) — Handbook of combinatorial optimization: supplement volume A | 152—154, 159, 161, 171—173, 197, 202—203, 211, 253, 342, 373, 382, 422, 524, 543, 576, 588, 592, 602 | | Pearl J. — Heuristics | 10 | | Samet H. — The design and analysis of spatial data structures | 7, 15, 430 | | Трауб Дж., Васильковский Г., Вожьняковский Х. — Информация, неопределенность, сложность | 90, 92, 135, 173 | | Papadimitriou C.H., Steiglitz K. — Combinatorial Optimization: Algorithms and Complexity | 155, 381, 401, 404, 431, 432, 445, 453, 486 | | Hein J.L. — Theory of Computation: An Introduction | 499, 552 | | Martello S., Toth P. — Knapsack problems: algorithms and computer implementations | 6, 8, 10, 177, 178, 222, 223, 233, 276, 277, 278 | | Bentley J. — Programming pearls | vi, 176 | | Habib M., McDiarmid C., Ramirez-Alfonsin J. (eds.) — Probabilistic Methods for Algorithmic Discrete Mathematics | 166, 193 | | Roberts F. S. — Graph theory and its applications to problems of society | 50, 53, 110 | | Gibbons A. — Algorithmic graph theory | 201, 210, 211, 241, 243, 244 | | Gibbons A. — Algorithmic graph theory | 201, 210, 211, 241, 243, 244 | | Du D.-Z., Ko K.-I. — Theory of computational complexity | 75, 76, 450 | | Foulds L.R. — Combinatorial optimization for undergraduates | 219 | | Bentley J. — Programming Pearls | vi, 176 | | Rubinoff M., Yovits M. — Advances in Computers, Volume 14 | 8, 42 | | Shen A. — Algorithms and Programming | 59, 212 |
|
|
|
|
О проекте