Maqola

Algorithms for minimizing functions of the algebra of logic in the class of disjunctive normal forms and estimating their complexity

Mansur BerdimurodovNational University of Uzbekistan named after Mirzo Ulugbek,dept. of Information security,Tashkent,UzbekistanAbdussattar BaizhumanovSouth Kazakhstan State Pedagogical University,dept. of Mathematics,Shymkent,Kazakhstan

2022en

ABI

Annotatsiya

The paper considers the problem of minimizing functions of the algebra of logic in the class of disjunctive normal forms. Algorithms for complete enumeration and bounded complexity for finding the shortest disjunctive normal forms of functions of the algebra of logic are developed and estimates for their complexity are calculated. An algorithm for minimizing the functions of the logic algebra of logic in the class of disjunctive normal forms is constructed based on the calculation of the error of the neighborhood of the first order of elementary conjunctions. The local analysis in the directed enumeration algorithm is investigated and its algorithmic complexity is estimated.

Mavzular

Advanced Computational Techniques in Science and Engineering Advanced Data Processing Techniques

Identifikatorlar

DOI: 10.1109/icisct55600.2022.10147007

Iqtiboslar va manbalar

0 ta iqtibos35 ta foydalanilgan manba

Koʻrsatkichlar — AkademScholar · Tez orada