A NOVEL APPROACH FOR FAST COVERING THE BOOLEAN SETS
Küçük Resim Yok
Tarih
2008
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
WORLD SCIENTIFIC AND ENGINEERING ACAD AND SOC
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
In this study we propose a new method for iteratively covering given Boolean data set by its prime implicants identified one at a time. In contrast to existing set covering methods of NP time complexity in the size of the set, our method is realized by procedures of linear complexity and therefore its efficiency is rapidly increased by increasing the size of the set. Our method can be useful in all fields related to Boolean data sets processing such as logic synthesis, image processing, data compressing, artificial intelligence and many others.
Açıklama
8th WSEAS International Conference on Systems Theory and Scientific Computation -- AUG 20-22, 2008 -- Rhodes, GREECE
Anahtar Kelimeler
Boolean set covering, bitwise operations, prime implicant
Kaynak
PROCEEDINGS OF THE 8TH WSEAS INTERNATIONAL CONFERENCE ON SYSTEMS THEORY AND SCIENTIFIC COMPUTATION (ISTAC'08): NEW ASPECTS OF SYSTEMS THEORY AND SCIENTIFIC COMPUTATION
WoS Q Değeri
N/A
