Skip to content
Publications

Talk · International Conference of Science and Information Technology in Smart Administration · November 10, 2022

Algorithms for Minimizing Disjunctions of Complex Conjunctions Based on First-Order Neighborhood Information for Solving Systems of Boolean Equations

Anvar Kabulov, Abdussattar Baizhumanov, Islambek Saymanov, Mansur Berdimurodov

Abstract

The neighborhoods of the 1st order of disjunctions of complex conjunctions of logical statements of systems of nonlinear Boolean equations given by Zhegalkin polynomials are investigated. A method for minimizing disjunctions based on the absorption of complex conjunctions by a first-order neighborhood is proposed. For this, criteria for the absorption of complex conjunctions by a first-order neighborhood are proved, similarly to the theory of Y.I.Zhuravlev on the absorption of elementary conjunctions in the class of disjunctive normal forms of Boolean functions. An algorithm for minimizing the disjunctions of complex conjunctions based on a neighborhood of the 1st order is developed.

Polynomial and algebraic computationCoding theory and cryptographyComplexity and Algorithms in GraphsZhegalkin polynomialsBoolean equation systemsminimization algorithms

More by Islambek Saymanov