Home
Hostname: page-component-684899dbb8-plzwj Total loading time: 0.451 Render date: 2022-05-18T10:27:57.235Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "useRatesEcommerce": false, "useNewApi": true }

1 - Fundamental concepts and applications

from Part I - Foundations

Published online by Cambridge University Press:  01 June 2011

Summary

The purpose of this introductory chapter is three fold. First, it contains the main definitions, terminology, and notations that are used throughout the book. After the introduction of our main feature characters–namely, Boolean functions–several sections are devoted to a discussion of alternative representations, or expressions, of Boolean functions. Disjunctive and conjunctive normal forms, in particular, are discussed at length in Sections 1.4–1.11. These special algebraic expressions play a very central role in our investigations, as we frequently focus on the relation between Boolean functions and their normal forms. Section 1.12, however, also provides a short description of different types of function representations, namely, representations over GF(2), pseudo-Boolean polynomial expressions, and binary decision diagrams.

A second objective of this chapter is to introduce several of the topics to be investigated in more depth in subsequent chapters, namely: fundamental algorithmic problems (Boolean equations, generation of prime implicants, dualization, orthogonalization, etc.) and special classes of Boolean functions (bounded-degree normal forms, monotone functions, Horn functions, threshold functions, etc.). Finally, the chapter briefly presents a variety of applications of Boolean functions in such diverse fields as logic, electrical engineering, reliability theory, game theory, combinatorics, and so on. These applications have often provided the primary motivation for the study of the problems to be encountered in the next chapters.

Type
Chapter
Information
Boolean Functions
Theory, Algorithms, and Applications
, pp. 3 - 66
Publisher: Cambridge University Press
Print publication year: 2011

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Purchase

Buy print or eBook[Opens in a new window]
3
Cited by

Save book to Kindle

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×