Before revision: Boolean function minimizing methods include: Quine–McCluskey algorithm Petrick's method Optimal multi-level methods Methods which find optimal circuit representations of Boolean functions are often referred as "exact synthesis " in the literature.
After revision: Boolean function minimizing methods include: Quine–McCluskey algorithm Petrick's method Optimal multi-level methods Methods that find optimal circuit representations of Boolean functions are often referred to as exact synthesis in the literature.