M. Yu. Romanov
Abstract
Boolean functions with a small number of zeros are studied. A linear algorithm for constructing a dead-end disjunctive normal form (DNF) is obtained for a function of special form from this class. The resulting dead-end DNF insignificantly differs from theoretical estimates for the minimal DNF.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Boolean functions with a small number of zeros are studied. A linear algorithm for constructing a dead-end disjunctive normal form (DNF) is obtained for a function of special form from this class. The resulting dead-end DNF insignificantly differs from theoretical estimates for the minimal DNF.
Key concepts: Boolean function, Disjunctive normal form, Mathematics, Class (philosophy), Function (biology), Conjunctive normal form, Parity function, Discrete mathematics