Boolean Models and Methods in Mathematics, Computer Science, and Engineering (Encyclopedia of Mathematics and its Applications)

✍ Scribed by Yves Crama (editor), Peter L. Hammer (editor)

• Publisher: Cambridge University Press
• Year: 2010
• Tongue: English
• Leaves: 780
• Series: Encyclopedia of Mathematics and its Applications (Book 134)
• Edition: 1
• Category: Library

✦ Synopsis

This collection of papers presents a series of in-depth examinations on a variety of advanced topics related to Boolean functions and expressions. The chapters are written by some of the most prominent experts in their respective fields and cover topics ranging from algebra and propositional logic to learning theory, cryptography, computational complexity, electrical engineering, and reliability theory.

✦ Table of Contents

Contents
Preface
Introduction
Acknowledgements
Contributors
Acronyms and Abbreviations
Part I. Algebraic Structures
1. Compositions and clones of Boolean functions
2. Decomposition of Boolean functions
Part II. Logic
3. Proof theory
4. Probabilistic analysis of satisfiability algorithms
5. Optimization methods in logic
Part III. Learning Theory and Cryptography
6. Probabilistic learning and Boolean functions
7. Learning Boolean functions with queries
8. Boolean functions for cryptography and error-correcting codes
9. Vectorial Boolean functions for cryptography
Part IV. Graph Representations and Efficient Computation Models
10. Binary decision diagrams
11. Circuit complexity
12. Fourier transforms and threshold circuit complexity
13. Neural networks and Boolean functions
14. Decision lists and related classes of Boolean functions
Part V. Applications in Engineering
15. Hardware equivalence and property verification
16. Synthesis of multi-level Boolean networks
17. Boolean aspects of network reliability