Boolean Functions Simplification Algorithm of O(n) Complexity
Şirzat Kahramanlı, Fatih Başçi̇ftçi̇ · Mathematical and Computational Applications · 2003
The minimization of Boolean functions allows designers to make use of fewer components, thus reducing the cost of particular system. All procedures for reducing either two-level or multilevel Boolean networks into prime and irredundant form have O(2n) complexity. Prime Implicants identification step can be computational impractical as n increases. Thus it is possible to get method in order to find the minimal set of Prime Implicants of O(n) complexity instead of O(2n).