Boolean Functions: Theory, Algorithms, and Applications

Encyclopedia of Mathematics and its Applications #142

by Yves Crama, Peter L. Hammer

Written by prominent experts in the field, this monograph provides the first comprehensive and unified presentation of the structural, algorithmic, and applied aspects of the theory of Boolean functions. The book focuses on algebraic representations of Boolean functions, especially disjunctive and conjunctive normal form representations. It presents in this framework the fundamental elements of the theory (Boolean equations and satisfiability problems, prime implicants and associated short representations, dualization), an in-depth study of special classes of Boolean functions (quadratic, Horn, shellable, regular, threshold, read-once functions and their characterization by functional equations), and two fruitful generalizations of the concept of Boolean functions (partially defined functions and pseudo-Boolean functions). Several topics are presented here in book form for the first time. Because of the unique depth and breadth of the unified treatment that it provides and of its emphasis on algorithms and applications, this monograph will have special appeal for researchers and graduate students in discrete mathematics, operations research, computer science, engineering, and economics.

710 pages, Hardcover

First published May 31, 2011

Reviews

[John Zobolas · Rating 5 out of 5]

Amazing textbook, easy-to-follow, recommended for beginner students to researchers for getting up to date with the boolean function world.