Enhancing the Minimization of Boolean and Multivalue Output Functions With eQMC


Configurational comparative methods have gained in popularity among sociologists and political scientists. In particular, Qualitative Comparative Analysis (QCA) has attracted considerable attention in recent years. The process of Boolean minimization by means of the Quine-McCluskey algorithm (QMC) is the central procedure in QCA, but QMC’s exactitude renders it memory intensive and slow in processing complex output functions. In this article, we introduce the enhanced QMC algorithm (eQMC) to alleviate these problems. eQMC is equally exact but, unlike QMC, capable of processing multivalent condition and outcome factors. Instead of replacing QMC, however, eQMC acts as an optimizing complement in contexts of limited empirical diversity. We demonstrate its speed and computer memory performance through simulations.

In Journal of Mathematical Sociology


pp. 92-108

Keywords: Boolean minimization, enhanced Quine-McCluskey algorithm, Qualitative Comparative Analysis (QCA), Quine-McCluskey algorithm, set theory