|
|
 |
| Результат поиска |
Поиск книг, содержащих: Complexity class
| Книга | Страницы для поиска | | Кормен Т., Лейзерсон Ч., Ривест Р. — Алгоритмы: построение и анализ | 843 | | Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 1) | 1608—1610, 1619, 1625, 1629, 1632, 1637, 1642 | | Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 2) | 1608—1610, 1619, 1625, 1629, 1632, 1637, 1642 | | Zimand M. — Computational Complexity: A Quantitative Perspective | 6, 28, 43, 47 | | Borwein P., Choi S., Rooney B. — The Riemann Hypothesis | 511 | | Papadimitriou C.H. — Computational Complexity | 29, 139 | | von zur Gathen J., Gerhard J. — Modern computer algebra | 685—687 | | Barwise J. (ed.) — Handbook of Mathematical Logic | 539 | | Hazewinkel M. — Handbook of Algebra (part 2) | 51 | | Kreher D.L., Stinson D.R. — Combinatorial Algorithms: Generation, Enumeration and Search | 13 | | Leeuwen J.V. — Handbook of Theoretical Computer Science: Algorithms and Complexity | 11, 182, 648, 761, 796 | | Hopcroft J.E., Ullman J.D. — Introduction to automata theory, languages, and computation | 288 | | Bridges D.S. — Computability: A mathematical sketchbook | 101, 170 | | Leeuwen J. (ed.), Meyer A.R., Nivat M. — Algorithms and Complexity, Volume A | 11,182,648,761,796 | | Salomaa A. — Computation and automata | 147 | | Du D.-Z., Ko K.-I. — Theory of computational complexity | 18 | | Burgisser P., Clausen M., Shokrollahi M.A. — Algebraic complexity theory | 208, 211, 212, 242 |
|
|
|
|
О проекте