Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A mathematical approach to the boolean minimization problem

A mathematical approach to the boolean minimization problem 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Quality & Quantity Springer Journals

A mathematical approach to the boolean minimization problem

Duşa, Adrian
Quality & Quantity , Volume 44 (1) – Oct 1, 2008
Download PDF
15 pages

Loading next page...
 
/lp/springer_journal/a-mathematical-approach-to-the-boolean-minimization-problem-M6bzSKNlFe

References (25)

Publisher
Springer Journals
Copyright
Copyright © 2008 by Springer Science+Business Media B.V.
Subject
Social Sciences; Methodology of the Social Sciences; Social Sciences, general
ISSN
0033-5177
eISSN
1573-7845
DOI
10.1007/s11135-008-9183-x
Publisher site
See Article on Publisher Site

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.

Journal

Quality & Quantity – Springer Journals

Published: Oct 1, 2008

There are no references for this article.