Next Article in Journal
Solvability Conditions and Green Functional Concept for Local and Nonlocal Linear Problems for a Second Order Ordinary Differential Equation
Previous Article in Journal
On the Mathematical Modeling of Beams Rotating about a Fixed Axis
 
 
Search for Articles:
Title / Keyword
Author / Affiliation / Email
Journal
Article Type
 
 
Advanced Search
 
Section
Special Issue
Volume
Issue
Number
Page
 
Journals
MCA
Volume 8
Issue 3
10.3390/mca8030271
mca-logo
Submit to this Journal Review for this Journal Propose a Special Issue
► Article Menu

Article Menu

share Share announcement Help format_quote Cite question_answer Discuss in SciProfiles
Mathematical and Computational Applications is published by MDPI from Volume 21 Issue 1 (2016). Previous articles were published by another publisher in Open Access under a CC-BY (or CC-BY-NC-ND) licence, and they are hosted by MDPI on mdpi.com as a courtesy and upon agreement with Association for Scientific Research (ASR).
first_page
settings
Order Article Reprints
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Boolean Functions Simplification Algorithm of O(n) Complexity

by
Şirzat Kahramanli
1,* and
Fatih Başçiftçi
2,*
1
Selcuk University, Department of Computer Engineering
2
Selcuk University, Department of Electronic and Computer Systems Education
*
Authors to whom correspondence should be addressed.
Math. Comput. Appl. 2003, 8(3), 271-278; https://doi.org/10.3390/mca8030271
Published: 1 December 2003
Versions Notes

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).
Keywords: Boolean function, simplification; minimization, Boolean expression; prime implicant; cube algebra; covering algorithm; simplification complexity; cube operations Boolean function, simplification; minimization, Boolean expression; prime implicant; cube algebra; covering algorithm; simplification complexity; cube operations

Share and Cite

MDPI and ACS Style

Kahramanli, Ş.; Başçiftçi, F. Boolean Functions Simplification Algorithm of O(n) Complexity. Math. Comput. Appl. 2003, 8, 271-278. https://doi.org/10.3390/mca8030271

AMA Style

Kahramanli Ş, Başçiftçi F. Boolean Functions Simplification Algorithm of O(n) Complexity. Mathematical and Computational Applications. 2003; 8(3):271-278. https://doi.org/10.3390/mca8030271

Chicago/Turabian Style

Kahramanli, Şirzat, and Fatih Başçiftçi. 2003. "Boolean Functions Simplification Algorithm of O(n) Complexity" Mathematical and Computational Applications 8, no. 3: 271-278. https://doi.org/10.3390/mca8030271

APA Style

Kahramanli, Ş., & Başçiftçi, F. (2003). Boolean Functions Simplification Algorithm of O(n) Complexity. Mathematical and Computational Applications, 8(3), 271-278. https://doi.org/10.3390/mca8030271

Article Metrics

Back to TopTop