|
|
 |
| Результат поиска |
Поиск книг, содержащих: Truth assignment
| Книга | Страницы для поиска | | Кормен Т., Лейзерсон Ч., Ривест Р. — Алгоритмы: построение и анализ | 852, 858 | | Niedermeier R. — Invitation to Fixed Parameter Algorithms | 58 | | Barwise J., Etchemendy J., Allwein G. — Language, Proof and Logic | 468 | | Garey M.R., Johnson D.S. — Computers and intractability. A guide to the theory of NP-completeness | 38, 261. | | Papadimitriou C.H. — Computational Complexity | 74 | | Hopcroft J.E., Motwani R., Ullman J.D. — Introduction to Automata Theory, Languages, and Computation | 426—427 | | Motwani R., Raghavan P. — Randomized algorithms | 19 | | Klerk de E. — Aspects of Semidefinite Programming | 211, 224 | | Papadimitriou C.H., Steiglitz K. — Combinatorial Optimization: Algorithms and Complexity | 314 | | Ding-Zhu D., Ker-I K. — Problem solving in automata, languages, and complexity | 325 | | Lewis H.R., Papadimitriou C.H. — Elements of the Theory of Computation | 289 | | Hinman P.G. — Fundamentals of Mathematical Logic | 17, 97 | | Du D.-Z., Ko K.-I. — Theory of computational complexity | 6 | | Suppes P.(ed.) — Handbook of Proof Theory.Studies in logic the foundations of mathematics.Volume 137. | 3, 702 | | Andrews P.B. — An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof | 134 | | Jones N.D. — Computability and complexity from a programming perspective | 420 |
|
|
|
|
О проекте