Kahramanlı, ŞirzatBaşçiftçi, Fatih2020-03-262020-03-262003Kahramanlı, Ş., Başçiftçi, F., (2003). Boolean Functıons Sımplıfıcatıon Algorıthm of O(N) Complexıty. Mathematical and Computational Applications, (8), 271-278.1300-686Xhttp://www.trdizin.gov.tr/publication/paper/detail/TXpFeU9ETXo=https://hdl.handle.net/20.500.12395/18270The 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/openAccessMatematikBoolean functionSimplificationMinimizationBoolean expressionPrime implicantCube algebraCovering algorithmSimplification complexityCube operationsOther801.Mar271278