Boolean Functıons Sımplıfıcatıon Algorıthm of O(N) Complexıty
dc.contributor.author | Kahramanlı, Şirzat | |
dc.contributor.author | Başçiftçi, Fatih | |
dc.date.accessioned | 2020-03-26T16:45:12Z | |
dc.date.available | 2020-03-26T16:45:12Z | |
dc.date.issued | 2003 | |
dc.department | Selçuk Üniversitesi | en_US |
dc.description.abstract | The 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). | en_US |
dc.identifier.citation | Kahramanlı, Ş., 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. | |
dc.identifier.endpage | 278 | en_US |
dc.identifier.issn | 1300-686X | en_US |
dc.identifier.issue | 01.Mar | en_US |
dc.identifier.startpage | 271 | en_US |
dc.identifier.uri | http://www.trdizin.gov.tr/publication/paper/detail/TXpFeU9ETXo= | |
dc.identifier.uri | https://hdl.handle.net/20.500.12395/18270 | |
dc.identifier.volume | 8 | en_US |
dc.indekslendigikaynak | TR-Dizin | en_US |
dc.institutionauthor | Kahramanlı, Şirzat | |
dc.institutionauthor | Başçiftçi, Fatih | |
dc.language.iso | en | en_US |
dc.relation.ispartof | Mathematical and Computational Applications | en_US |
dc.relation.publicationcategory | Diğer | en_US |
dc.rights | info:eu-repo/semantics/openAccess | en_US |
dc.selcuk | 20240510_oaig | en_US |
dc.subject | Matematik | en_US |
dc.subject | Boolean function | |
dc.subject | Simplification | |
dc.subject | Minimization | |
dc.subject | Boolean expression | |
dc.subject | Prime implicant | |
dc.subject | Cube algebra | |
dc.subject | Covering algorithm | |
dc.subject | Simplification complexity | |
dc.subject | Cube operations | |
dc.title | Boolean Functıons Sımplıfıcatıon Algorıthm of O(N) Complexıty | en_US |
dc.type | Other | en_US |
Dosyalar
Orijinal paket
1 - 1 / 1