Boolean Models and Methods in Mathematics, Computer Science, and Engineering

A collection of papers written by prominent experts that examine a variety of advanced topics related to Boolean functions and expressions.

Yves Crama (Edited by), Peter L. Hammer (Edited by)

9780521847520, Cambridge University Press

Hardback, published 28 June 2010

780 pages, 91 b/w illus. 7 tables
24.3 x 16.3 x 4.7 cm, 1.22 kg

' … is likely to become the reference book for applications of Boolean functions. A common effort of twenty two authors and two editors, leading experts in their fields, the monograph, over 700 pages long, covers all important topics and presents state-of-the-art of applications of Boolean functions. This well written volume can be useful to graduate students, researchers in discrete mathematics, computer science, or other fields, as well as practitioners of operations research and combinatorial optimization. Also readers like me, who want to learn more about Boolean functions, will find this volume very informative.' Marcin Kaminski, SIGACT News

This collection of papers presents a series of in-depth examinations of 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. Beyond the diversity of the questions raised and investigated in different chapters, a remarkable feature of the collection is the common thread created by the fundamental language, concepts, models, and tools provided by Boolean theory. Many readers will be surprised to discover the countless links between seemingly remote topics discussed in various chapters of the book. This text will help them draw on such connections to further their understanding of their own scientific discipline and to explore new avenues for research.

Part I. Algebraic Structures: 1. Compositions and clones of Boolean functions Reinhard Pöschel and Ivo Rosenberg
2. Decomposition of Boolean functions Jan C. Bioch
Part II. Logic: 3. Proof theory Alasdair Urquhart
4. Probabilistic analysis of satisfiability algorithms John Franco
5. Optimization methods in logic John Hooker
Part III. Learning Theory and Cryptography: 6. Probabilistic learning and Boolean functions Martin Anthony
7. Learning Boolean functions with queries Robert H. Sloan, Balázs Szörényi and György Turán
8. Boolean functions for cryptography and error-correcting codes Claude Carlet
9. Vectorial Boolean functions for cryptography Claude Carlet
Part IV. Graph Representations and Efficient Computation Models: 10. Binary decision diagrams Beate Bollig, Martin Sauerhoff, Detlef Sieling and Ingo Wegener
11. Circuit complexity Matthias Krause and Ingo Wegener
12. Fourier transforms and threshold circuit complexity Jehoshua Bruck
13. Neural networks and Boolean functions Martin Anthony
14. Decision lists and related classes of Boolean functions Martin Anthony
Part V. Applications in Engineering: 15. Hardware equivalence and property verification J. H. Roland Jiang and Tiziano Villa
16. Synthesis of multi-level Boolean networks Tiziano Villa, Robert K. Brayton and Alberto L. Sangiovanni-Vincentelli
17. Boolean aspects of network reliability Charles J. Colbourn.

Subject Areas: Algorithms & data structures [UMB], Optimization [PBU]