作者: Sirzat Kahramanli , Fatih Basççiftçi
DOI:
关键词:
摘要: In this study we propose a new method for iteratively covering given Boolean data set by its prime implicants identified one at time. contrast to existing methods of NP time complexity in the size set, our is realized procedures linear and therefore efficiency rapidly increased increasing set. Our can be useful all fields related sets processing such as logic synthesis, image processing, compressing, artificial intelligence many others.