|
|
 |
| Результат поиска |
Поиск книг, содержащих: Turing machine, nondeterministic
| Книга | Страницы для поиска | | Zimand M. — Computational Complexity: A Quantitative Perspective | 3 | | Garey M.R., Johnson D.S. — Computers and intractability. A guide to the theory of NP-completeness | 12—13, 30—31. | | Sipser M. — Introduction to the theory of computation | 150—152 | | Papadimitriou C.H. — Computational Complexity | 45, 171 | | Hein J.L. — Discrete Structures, Logic, and Computability | 706 | | Papadimitriou C.H., Steiglitz K. — Combinatorial Optimization: Algorithms and Complexity | 398 | | Ebbinghaus H.-D., Flum J. — Finite Model Theory | 125, 132 | | Bóna M. — A Walk Through Combinatorics: An Introduction to Enumeration and Graph Theory | 443 | | Hein J.L. — Theory of Computation: An Introduction | 391 | | Lewis H.R., Papadimitriou C.H. — Elements of the Theory of Computation | 221—226, 292—294 | | Leeuwen J.V. — Handbook of Theoretical Computer Science: Algorithms and Complexity | 18, 73, 761 | | Bridges D.S. — Computability: A mathematical sketchbook | 6 | | Leeuwen J. (ed.), Meyer A.R., Nivat M. — Algorithms and Complexity, Volume A | 18, 73,761 | | Bäck T. — Evolutionary Algorithms in Theory and Practice | 54 | | Sipser M. — Introduction to the Theory of Computation | 138—140 |
|
|
|
|
О проекте