✨
Yapay Zeka Hızlı Bakış & Çıkarımlar
AI Insight⚡ TL;DR(1 Cümlede Hızlı Çıkarım)
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 Maddede Bu Makale
🎯
Amaç & Hipotez:The minimization of Boolean functions allows designers to make use of fewer components, thus reducing the cost of particular system.
📊
Temel Bulgular & Veri:All procedures for reducing either two-level or multilevel Boolean networks into prime and irredundant form have O($2^n$) complexity.
💡
Sonuç & Katkı: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$).
🔬Tür:Araştırma Makalesi
📍Kapsam:Genişletilmiş Akademik Örneklem
⚙️Değişkenler:Alan Parametreleri
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$).
🔖
Bu Makaleye Atıf Yap
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