Decomposition of Boolean functions

  • Sergiu Rudeanu
Part of the Discrete Mathematics and Theoretical Computer Science book series (DISCMATH)


The synthesis problem in switching theory, that is, th e problem of designing a circuit from given building blocks, has led since the 1950s to an extensive study of the decomposition of truth functions (usually referred to as Boolean functions). Roughly speaking, this problem consists in expressing an arbitrary truth function by means of other (convenient) truth functions. In BFE, Chapter 16, §1, we have reported a few methods and results in this line of research. We strongly suggest that this field deserves a separate monograph.


Boolean Function Truth Function Boolean Equation Historical Sketch Disjoint Decomposition 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag London 2001

Authors and Affiliations

  • Sergiu Rudeanu
    • 1
  1. 1.Faculty of MathematicsUniversity of BucharestBucharestRomania

Personalised recommendations