Boolean Functions : Theory, Algorithms, and Applications Hardback
Part of the Encyclopedia of Mathematics and its Applications series
Written by prominent experts in the field, this monograph provides the first comprehensive, 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.
This framework looks at 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 depth and breadth and 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.
- Format: Hardback
- Pages: 710 pages, Worked examples or Exercises; 3 Halftones, unspecified; 95 Line drawings, unspecified
- Publisher: Cambridge University Press
- Publication Date: 16/05/2011
- Category: Mathematical logic
- ISBN: 9780521847513