Kahramanli Ş.Başçiftçi F.2020-03-262020-03-2620031300686Xhttps://hdl.handle.net/20.500.12395/18673The 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).eninfo:eu-repo/semantics/openAccessBoolean expressionBoolean functionCovering algorithmCube algebraCube operationsMinimizationPrime implicantSimplificationSimplification complexityConference Object801.03.2020271278N/A