|
|
 |
| Результат поиска |
Поиск книг, содержащих: Satisfiability problem
| Книга | Страницы для поиска | | Кормен Т., Лейзерсон Ч., Ривест Р. — Алгоритмы: построение и анализ | 859 | | Ross S.M. — Introduction to probability models | 193—195 | | Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 1) | 1615—1617 | | Chagrov A., Zakharyaschev M. — Modal logic | 558 | | Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 2) | 1615—1617 | | Wegener I. — Complexity of Boolean Functions | 270, 289 | | Zimand M. — Computational Complexity: A Quantitative Perspective | 55 | | Lawler E.L. — Combinatorial Optimization: Networks and Matroids | 9 | | Sipser M. — Introduction to the theory of computation | 271 | | Hopcroft J.E., Motwani R., Ullman J.D. — Introduction to Automata Theory, Languages, and Computation | 426—434, 462, 471 | | Nishizeki T., Chiba N. — Planar Graphs: Theory and Algorithms (North-Holland Mathematics Studies) | 26 | | Cook W.J., Cunningham W.H., Pulleyblank W.R. — Combinatorial optimization | 316 | | Abramsky S., Gabbay D.M., Maibaum T.S.E. — Handbook of Logic in Computer Science: Volume 5: Logic and Algebraic Methods | 132 | | Habib M., McDiarmid C., Ramirez-Alfonsin J. (eds.) — Probabilistic Methods for Algorithmic Discrete Mathematics | 3, 4 | | Hopcroft J.E., Ullman J.D. — Introduction to automata theory, languages, and computation | 325—331, 370 | | Aldous J.M., Wilson R. — Graphs and Applications: An Introductory Approach | 342 | | Hartmann A.K., Rieger H. — Optimization Algorithms in Physics | 19—22, 23, 25, 273 | | Sipser M. — Introduction to the Theory of Computation | 249 | | Burgisser P., Clausen M., Shokrollahi M.A. — Algebraic complexity theory | 544 |
|
|
|
|
О проекте