|
|
 |
| Результат поиска |
Поиск книг, содержащих: NPSPACE
| Книга | Страницы для поиска | | Garey M.R., Johnson D.S. — Computers and intractability. A guide to the theory of NP-completeness | 175—176. | | Sipser M. — Introduction to the theory of computation | 308 | | Motwani R., Raghavan P. — Randomized algorithms | 20 | | Ebbinghaus H.-D., Flum J. — Finite Model Theory | 126 | | Du D.-Z., Ko K.-I. — Theory of computational complexity | 33 | | Davis M., Sigal R., Weyuker E. — Computability, complexity, and languages: Fundamentals of theoretical computer science | 451 | | Sipser M. — Introduction to the Theory of Computation | 281 | | Jones N.D. — Computability and complexity from a programming perspective | 333, 345, 346 |
|
|
|
|
О проекте