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.
| ISBN: | 9780521847513 |
| Publication date: | 16th May 2011 |
| Author: | Yves Université de Liège, Belgium Crama, Peter L Rutgers University, New Jersey Hammer |
| Publisher: | Cambridge University Press |
| Format: | Hardback |
| Pagination: | 710 pages |
| Series: | Encyclopedia of Mathematics and its Applications |
| Genres: |
Mathematical logic Optimization Computer architecture and logic design |
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.
Boolean Functions features in the following genres: Mathematical logic, Optimization, Computer architecture and logic design
Boolean Functions is available in Hardback
Boolean Functions was written by Yves Université de Liège, Belgium Crama, Peter L Rutgers University, New Jersey Hammer and published by Cambridge University Press
Boolean Functions has 710 pages
Yes it is part of Encyclopedia of Mathematics and its Applications series
£152.10