|
|
Электронная библиотека
механико-математического факультета
Московского государственного университета
|
|
|
|
|
| Результат поиска |
Поиск книг, содержащих: Disjunctive normal form
| Книга | Страницы для поиска | | Кормен Т., Лейзерсон Ч., Ривест Р. - Алгоритмы: построение и анализ | 1124 | | Hobbs C. - A Practical Approach to WBEM/CIM Management | 108 | | Christofides N. - Combinatorial Optimization | 171 | | Cameron P.J. - Combinatorics : Topics, Techniques, Algorithms | 195, 208 | | Rips J.L. - The psychology of proof: deductive reasoning in human thinking | 366 | | Ebbinghaus H.-D., Flum J., Thomas W. - Mathematical logic | 126 | | Gilbert W.J., Nicholson W.K. - Modern Algebra with Applications | 30 | | Steen S.W.P. - Mathematical Logic with Special Reference to the Natural Numbers | 56, 64, 68 | | Wegener I. - Complexity of Boolean Functions | 5 | | Halmos P.R., Givant S. - Logic as Algebra | 89 | | Engel K. - Sperner theory | 195 | | Simpson S.G. - Mathematical Logic | 9 | | Hein J.L. - Discrete Mathematics | 323 | | Rowe N.C. - Artifical intelligence through Prolog | 179, 382 | | Papadimitriou C.H. - Computational Complexity | 75 | | Motwani R., Raghavan P. - Randomized algorithms | see 'DNF' | | Morelos-Zaragoza R.H. - The art of error-correcting coding | 27 | | Kushilevitz E., Nisan N. - Communication Complexity | 120 | | Monk J.D. - Mathematical Logic | 127, 235 | | Hein J.L. - Discrete Structures, Logic, and Computability | 320 | | Lawrence C. Paulson - ML for the working programmer | 170 | | Müller S.M.(ed.), Paul W.J.(ed.) - The Complexity of Simple Computer Architectures | see 'DNF' | | Maier D. - The theory of relational databases | see Normal form | | Aigner M. - Combinatorial Theory | 165 | | Hein J.L. - Theory of Computation: An Introduction | 123 | | Smullyan R.M. - First-Order Logic | 13 | | Perrin D., Pin J.-E. - Infinite Words: Automata, Semigroups, Logic abd Games | 334 | | Seymour L. - Schaum's Outline of Theory and Problems of Discrete Math | 483 | | Leeuwen J.V. - Handbook of Theoretical Computer Science: Algorithms and Complexity | 764 | | Stinson D.R. - Cryptography: Theory and practice | 488 | | Leeuwen J. (ed.), Meyer A.R., Nivat M. - Algorithms and Complexity, Volume A | 764 | | Gries D. - A Logical Approach to Discrete Math | 67 | | Hinman P.G. - Fundamentals of Mathematical Logic | 37, 110 | | Lipschutz S., Lipson M.L. - Schaum's outline of theory and problems of discrete mathematics | 483 | | Kneebone G.T. - Mathematical Logic and the Foundations of Mathematics: An Introductory Survey | 99 | | Ben-Ari M - Mathematical Logic for Computer Science | 99 | | Monk J.D. (ed.) - Handbook of Boolean Algebras, Vol. 1 | 51 | | Spears W.M. - Evolutionary Algorithms. The Role of Mutation and Recombination | 35, 200-201 | | Davis M., Sigal R., Weyuker E. - Computability, complexity, and languages: Fundamentals of theoretical computer science | 356-360, 444 | | Gossett E. - Discrete Math with Proof | 770 | | Heinz-Dieter E., Jorg F., Wolfgang T. - Mathematical Logic | 126 | | Ebbinghaus H., Flum J., Thomas W. - Mathematical Logic: Undergraduate Texts in Mathematics (Undergraduate texts in mathematics) | 126 | | Ackermann W. - Solvable Cases of the Decision Problem | 20 | | Anthony M. - Discrete Mathematics Of Neural Networks | 11 | | Elliott Mendelson - Introduction to mathematical logic | 28 | | Steen S. - Mathematical Logic with Special Reference to the Natural Numbers | 56, 64, 68 | | Andrews P.B. - An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof | 28, 29, 32 | | Horowitz E., Rajasekaran S., Sahui S. - Computer Algorithms | 503 | | Gill A. - Applied Algebra for the Computer Sciences | 133 | | Hill F.J., Peterson G.R. - Computer Aided Logical Design with Emphasis on VLSI | 83 | | Gries D. - The science of programming | 27 |
|
|
|
|
|
|
|
О проекте