Buch, Englisch, 710 Seiten, Format (B × H): 161 mm x 240 mm, Gewicht: 1348 g
Theory, Algorithms, and Applications
Buch, Englisch, 710 Seiten, Format (B × H): 161 mm x 240 mm, Gewicht: 1348 g
Reihe: Encyclopedia of Mathematics and its Applications
ISBN: 978-0-521-84751-3
Verlag: Cambridge University Press
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 ist 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.
Autoren/Hrsg.
Fachgebiete
- Technische Wissenschaften Technik Allgemein Mathematik für Ingenieure
- Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen Angewandte Mathematik, Mathematische Modelle
- Mathematik | Informatik Mathematik Mathematik Allgemein Mathematische Logik
- Mathematik | Informatik Mathematik Operations Research
- Mathematik | Informatik Mathematik Mathematik Allgemein Diskrete Mathematik, Kombinatorik
Weitere Infos & Material
Part I. Foundations: 1. Fundamental concepts and applications
2. Boolean equations
3. Prime implicants and minimal DNFs Peter L. Hammer and Alexander Kogan
4. Duality theory Yves Crama and Kazuhisa Makino
Part II. Special Classes: 5. Quadratic functions Bruno Simeone
6. Horn functions Endre Boros
7. Orthogonal forms and shellability
8. Regular functions
9. Threshold functions
10. Read-once functions Martin C. Golumbic and Vladimir Gurvich
11. Characterizations of special classes by functional equations Lisa Hellerstein
Part III. Generalizations: 12. Partially defined Boolean functions Toshihide Ibaraki
13. Pseudo-Boolean functions
Appendix A. Graphs and hypergraphs
Appendix B. Algorithmic complexity
Appendix C. JBool: a software tool Claude Benzaken and Nadia Brauner.




