Quine–McCluskey algorithm

The Quine–McCluskey algorithm (QMC), also known as the method of prime implicants or the tabulation method, is a method used for minimization of Boolean functions that was developed by Willard V. Quine in 1952 and extended by Edward J. McCluskey in 1956. As a general principle this approach had already been demonstrated by the logician Hugh McColl in 1878, was proved by Archie Blake in 1937, and was rediscovered by Edward W. Samson and Burton E. Mills in 1954 and by Raymond J. Nelson in 1955.

Source: Wikipedia — Quine–McCluskey algorithm (CC BY-SA 4.0)