✨
AI Summary & Key Takeaways
AI Insight⚡ TL;DR(Too Long; Didn't Read)
Thus it is possible to get method in order to find the minimal set of Prime Implicants of O(n) complexity instead of O($2^n$).
📌 3 Key Takeaways
🎯
Objective & Hypothesis:The minimization of Boolean functions allows designers to make use of fewer components, thus reducing the cost of particular system.
📊
Key Findings & Data:All procedures for reducing either two-level or multilevel Boolean networks into prime and irredundant form have O($2^n$) complexity.
💡
Conclusion & Impact:Thus it is possible to get method in order to find the minimal set of Prime Implicants of O(n) complexity instead of O($2^n$).
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters
Abstract
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($2^n$) 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($2^n$).
🔖
Cite This Article
KAHRAMANLI, Ş., BAŞÇİFTÇİ, F. (2003). Boolean functıons sımplıfıcatıon algorıthm of o(n) complexıty. Mathematical and Computational Applications, Cilt: 8 - Sayı: 1, 271–278. https://ajindex.com/articles/280378