A NOVEL APPROACH FOR FAST COVERING THE BOOLEAN SETS
| dc.contributor.author | Basciftci, Fatih | |
| dc.contributor.author | Kahramanli, Sirzat | |
| dc.date.accessioned | 2020-03-26T17:26:20Z | |
| dc.date.available | 2020-03-26T17:26:20Z | |
| dc.date.issued | 2008 | |
| dc.department | Selçuk Üniversitesi | en_US |
| dc.description | 8th WSEAS International Conference on Systems Theory and Scientific Computation -- AUG 20-22, 2008 -- Rhodes, GREECE | en_US |
| dc.description.abstract | 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. | en_US |
| dc.description.sponsorship | WSEAS | en_US |
| dc.description.sponsorship | Selcuk University's Scientific Research ProjectsSelcuk University | en_US |
| dc.description.sponsorship | This work is supported by the Coordinatorship of Selcuk Universitys Scientific Research Projects. | en_US |
| dc.identifier.endpage | + | en_US |
| dc.identifier.isbn | 978-960-6766-96-1 | |
| dc.identifier.issn | 1792-4308 | en_US |
| dc.identifier.startpage | 260 | en_US |
| dc.identifier.uri | https://hdl.handle.net/20.500.12395/22170 | |
| dc.identifier.wos | WOS:000263293100040 | en_US |
| dc.identifier.wosquality | N/A | en_US |
| dc.indekslendigikaynak | Web of Science | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | WORLD SCIENTIFIC AND ENGINEERING ACAD AND SOC | en_US |
| dc.relation.ispartof | PROCEEDINGS OF THE 8TH WSEAS INTERNATIONAL CONFERENCE ON SYSTEMS THEORY AND SCIENTIFIC COMPUTATION (ISTAC'08): NEW ASPECTS OF SYSTEMS THEORY AND SCIENTIFIC COMPUTATION | en_US |
| dc.relation.ispartofseries | Mathematics and Computers in Science and Engineering | |
| dc.relation.publicationcategory | Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı | en_US |
| dc.rights | info:eu-repo/semantics/closedAccess | en_US |
| dc.selcuk | 20240510_oaig | en_US |
| dc.subject | Boolean set covering | en_US |
| dc.subject | bitwise operations | en_US |
| dc.subject | prime implicant | en_US |
| dc.title | A NOVEL APPROACH FOR FAST COVERING THE BOOLEAN SETS | en_US |
| dc.type | Conference Object | en_US |
