prime implicant chart
1Quine–McCluskey algorithm — The Quine–McCluskey algorithm (or the method of prime implicants) is a method used for minimization of boolean functions which was developed by W.V. Quine and Edward J. McCluskey. It is functionally identical to Karnaugh mapping, but the tabular… …
2Petrick's method — In Boolean algebra, Petrick s method (also known as the branch and bound method) is a technique for determining all minimum sum of products solutions from a prime implicant chart. Petrick s method is very tedious for large charts, but it is easy… …
