A mathematical approach to the Boolean minimization problem

A groundbreaking work, at that time capable of solving problems nine times more complex than QCA’s best software, fs/QCA

QCA
Boolean minimization
Complexity

Author
Affiliation
Published

2010

Abstract

Any minimization problem involves a computer algorithm. Many such algorithms have been developed for the boolean minimizations, in diverse areas from computer science to social sciences (with the famous QCA algorithm). For a small number of entries (causal conditions in the QCA) any such algorithm will find a minimal solution, especially with the aid of the modern computers. However, for a large number of conditions a quick and complete solution is not easy to find using an algorithmic approach, due to the extremely large space of possible combinations to search in. In this article I will demonstrate a simple alternative solution, a mathematical method to obtain all possible minimized prime implicants. This method is not only easier to understand than other complex algorithms, but it proves to be a faster method to obtain an exact and complete boolean solution.

Citation

BibTeX citation:
@article{dușa2010,
  author = {Dușa, Adrian},
  publisher = {Springer},
  title = {A Mathematical Approach to the {Boolean} Minimization
    Problem},
  journal = {Quality \& Quantity},
  volume = {44},
  pages = {99-113},
  date = {2010-01-01},
  url = {https://link.springer.com/article/10.1007/s11135-008-9183-x},
  doi = {10.1007/s11135-008-9183-x},
  issn = {0033-5177},
  langid = {en}
}
For attribution, please cite this work as:
Dușa, Adrian. 2010. “A Mathematical Approach to the Boolean Minimization Problem.” Quality & Quantity 44 (January): 99–113. https://doi.org/10.1007/s11135-008-9183-x.