|
|
Результат поиска |
Поиск книг, содержащих: Boolean function
Книга | Страницы для поиска | Кормен Т., Лейзерсон Ч., Ривест Р. — Алгоритмы: построение и анализ | 105 | Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 1) | 1472, 2014, 2015, 2017 | Grimaldi R.P. — Discrete and combinatorial mathematics. An introduction | 736—743, 745—754, 759, 760, 772, 773 | Becker K.H., Dörfler M. — Dynamical Systems and Fractals : Computer Graphics Experiments with Pascal | 94 | Chagrov A., Zakharyaschev M. — Modal logic | 19 | Cheng F., deHaan J., Dixon R.L. — ActionScript 2.0 Language Reference for Macromedia Flash 8 | | Cameron P.J. — Combinatorics : Topics, Techniques, Algorithms | 18 | Powers S. — Learning JavaScript | | Graham R.L., Grotschel M., Lovasz L. — Handbook of combinatorics (vol. 2) | 1472, 2014, 2015, 2017 | Gupta M.M., Jin L., Homma N. — Static and dynamic neural networks | 511 | Comtet L. — Advanced Combinatorics. The Art of Finite and Infinate Expansions | 185 | Wicker S.B., Kim S. — Fundamentals of Codes, Graphs, and Iterative Decoding | xiv, 46 | Garey M.R., Johnson D.S. — Computers and intractability. A guide to the theory of NP-completeness | 261. | Papadimitriou C.H. — Computational Complexity | 79 | Morelos-Zaragoza R.H. — The art of error-correcting coding | 27 | Irvine K.R. — Assembly Language for Intel-Based Computers | 27—29 | Braunstein S.L. — Quantum computing | 3 | Kolman B., Busby R.C., Cutler S.C. — Discrete Mathematical Structures | 172 | Hammer P.L., Rudeanu S. — Boolean methods in operations research and related areas | 6ff., 24 | Aigner M. — Combinatorial Theory | 165, 246 | Birknoff — Lattice Theory | 163 | Hubbard J.R. — Theory and Problems of Programming with C++ | 100 | Ding-Zhu D., Ker-I K. — Problem solving in automata, languages, and complexity | 204, 324 | Ilachinski A. — Cellular automata. A discrete universe | 312, 429, 430, 516 | Liu C.L. — Introduction to combinatorial mathematics | 21 | Birkhoff G., Mac Lane S. — A Survey of Modern Algebra | 368 | Sachkov V.N., Tarakanov V.E. — Combinatorics of Nonnegative Matrices | 149 | Leeuwen J.V. — Handbook of Theoretical Computer Science: Algorithms and Complexity | (see also basis of) | Iverson K.E. — A Programming Language | 263 | Lipschutz S., Lipson M.L. — Schaum's outline of theory and problems of discrete mathematics | 491 | Du D.-Z., Ko K.-I. — Theory of computational complexity | 5 | Suppes P.(ed.) — Handbook of Proof Theory.Studies in logic the foundations of mathematics.Volume 137. | 3 | Grimaldi R.P., Rothman D.J. — Discrete and Combinatorial Mathematics: An Applied Introduction | 711—727, 729—733, 738, 742, 744, 796 | Anthony M. — Discrete Mathematics Of Neural Networks | 9 | Veelenturf L.P.J. — Analysis and applications of artificial neural networks | 11, 40—43 | Burgisser P., Clausen M., Shokrollahi M.A. — Algebraic complexity theory | 544 | Gill A. — Applied Algebra for the Computer Sciences | 173 | Kolman B., Busby R.C., Ross S. — Discrete Mathematical Structures | 179 | Rautenberg W. — A Concise Introduction to Mathematical Logic (Universitext) | 2 | Jacky J. — The Way of Z: Practical Programming with Formal Methods | 109, 280, 286 | Grimaldi R.P. — Student Solutions Manual for Discrete and Combinatorial Mathematics | 711—727, 729—733, 738, 742, 744, 796 | Bruss D. (ed.), Leuchs G. (ed.) — Lectures on Quantum Information | 315 | Adámek J. — Foundations of Coding | 138 |
|
|