|
|
 |
| Результат поиска |
Поиск книг, содержащих: Approximation algorithm
| Книга | Страницы для поиска | | Кормен Т., Лейзерсон Ч., Ривест Р. — Алгоритмы: построение и анализ | 880 | | Zimand M. — Computational Complexity: A Quantitative Perspective | 226 | | Niedermeier R. — Invitation to Fixed Parameter Algorithms | 3, 15, 20, 33, 64, 120, 237 | | Sipser M. — Introduction to the theory of computation | 365—367 | | Papadimitriou C.H. — Computational Complexity | 300 | | Purdom R.W., Brown C.A. — The analysis of algorithms | 438 | | Klerk de E. — Aspects of Semidefinite Programming | 174 | | Papadimitriou C.H., Steiglitz K. — Combinatorial Optimization: Algorithms and Complexity | 401, 406—30 | | Nishizeki T., Chiba N. — Planar Graphs: Theory and Algorithms (North-Holland Mathematics Studies) | 119, 122, 163, 164, 166, 170 | | Lewis H.R., Papadimitriou C.H. — Elements of the Theory of Computation | 335—337 | | Gallavotti G. — Foundations of fluid mechanics | 84 | | Gibbons A. — Algorithmic graph theory | 178 | | Gibbons A. — Algorithmic graph theory | 178 | | Bäck T. — Evolutionary Algorithms in Theory and Practice | 56 | | Sipser M. — Introduction to the Theory of Computation | 333—335 |
|
|
|
|
О проекте