Basciftci, FatihKahramanli, Sirzat2020-03-262020-03-262008978-960-6766-96-11792-4308https://hdl.handle.net/20.500.12395/221708th WSEAS International Conference on Systems Theory and Scientific Computation -- AUG 20-22, 2008 -- Rhodes, GREECEIn 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.eninfo:eu-repo/semantics/closedAccessBoolean set coveringbitwise operationsprime implicantConference Object260+WOS:000263293100040N/A