scientific article

zbMath0979.06001MaRDI QIDQ2748260

Oleg Vladimirovich Zubkov, Aleksandr Sergeevich Balyuk, Vladimir Innokent'evich Panteleev, A. I. Gaĭdukov, Konstantin Dmitrievich Kirichenko, Yulia V. Peryazeva, Nikolaĭ Alekseevich Peryazev, Sergeĭ Fedorovich Vinokurov

Publication date: 14 October 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

complexityalgorithmscanonical formsdecompositionspartial derivativescascadeZhegalkin polynomialpolynomial expansionsoperator polynomial formsrepetition-free Boolean functions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Boolean functions (06E30) Boolean functions (94D10) Research exposition (monographs, survey articles) pertaining to ordered structures (06-02)

Related Items

Complexity of Boolean functions' representations in classes of extended pair-generated operator forms, Refined estimates of the number of repetition-free Boolean functions in the full binary basis \(\{\&,\vee,\oplus,-\}\), On the asymptotics of the number of repetition-free Boolean functions in the basis \(\{\&, \vee, \otimes, \neg\}\), On read-once Boolean functions in elementary base extended by median, An algorithm for minimization of Boolean functions in the class of Toffoli reversible logic circuits, Asymptotics of the number of repetition-free Boolean functions in the elementary basis, Complexity lower bound for Boolean functions in the class of extended operator forms, On read-once multifunctions in some base, On Decomposition of Sub-definite Partial Boolean Functions