On the complexity of joint realization of Boolean functions regular systems in the DNF basis

DOI10.4213/MVK15MaRDI QIDQ4959000zbMATH OpenOpenAlexFDO

Authors V. G. Nikonov, A. V. Sarantsev

Publication date 15 September 2021

Published in Matematicheskie Voprosy Kriptografii [Mathematical Aspects of Cryptography] (Search for Journal in Brave)

Full work available at URL http://mathnet.ru/eng/mvk15

zbMATH Keywords

permutationDNFcomplexity of realisationregular system of Boolean functions

Mathematics Subject Classification ID

Boolean functions (06E30) Boolean functions (94D10)

Recommendations

• scientific article; zbMATH DE number 3970686
• On the complexity of realization of the linear function by formulas over finite Boolean bases
• On the comparison of complexity of two ways of realization of some linear Boolean functions
• scientific article; zbMATH DE number 26594
• On the comparison of Boolean bases

Cites work

• scientific article; zbMATH DE number 3871193 (Why is no real title available?)
• scientific article; zbMATH DE number 194333 (Why is no real title available?)
• scientific article; zbMATH DE number 822064 (Why is no real title available?)
• scientific article; zbMATH DE number 3190323 (Why is no real title available?)
• Coverings of Boolean graphs
• The Problem of Simplifying Truth Functions

Cited in

(4)

• Properties of substitutions generated by a class of filtering generators;Свойства подстановок, порождаемых одним классом фильтрующих генераторов
• scientific article; zbMATH DE number 7310234 (Why is no real title available?)
• Nonlinear permutations of a space over a finite field induced by linear transformations of a module over a Galois ring
• Description of the feedback function of a nonlinear shift register

This page was built for publication: On the complexity of joint realization of Boolean functions regular systems in the DNF basis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4959000)