Boolean functions simplification algorithm of O(n) complexity

Basit Öğe Kaydı
dc.contributor.authorKahramanli Ş.
dc.contributor.authorBaşçiftçi F.
dc.date.accessioned2020-03-26T16:46:31Z
dc.date.available2020-03-26T16:46:31Z
dc.date.issued2003
dc.departmentSelçuk Üniversitesien_US
dc.description.abstractThe 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).en_US
dc.identifier.endpage278en_US
dc.identifier.issn1300686Xen_US
dc.identifier.issue01.03.2020en_US
dc.identifier.scopusqualityN/Aen_US
dc.identifier.startpage271en_US
dc.identifier.urihttps://hdl.handle.net/20.500.12395/18673
dc.identifier.volume8en_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.relation.ispartofMathematical and Computational Applicationsen_US
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.selcuk20240510_oaigen_US
dc.subjectBoolean expressionen_US
dc.subjectBoolean functionen_US
dc.subjectCovering algorithmen_US
dc.subjectCube algebraen_US
dc.subjectCube operationsen_US
dc.subjectMinimizationen_US
dc.subjectPrime implicanten_US
dc.subjectSimplificationen_US
dc.subjectSimplification complexityen_US
dc.titleBoolean functions simplification algorithm of O(n) complexityen_US
dc.typeConference Objecten_US

Dosyalar

Orijinal paket
Listeleniyor 1 - 1 / 1
Küçük Resim
İsim:
document (2).pdf
Boyut:
567.97 KB
Biçim:
Adobe Portable Document Format
Açıklama:
İndir

Koleksiyon

Scopus İndeksli Yayınlar Koleksiyonu