On irreduceability of Boolean functions with respect to commutative associative operation

DOI10.3103/S0027132220040051zbMath1484.06051OpenAlexW3137102723MaRDI QIDQ2027875

G. V. Bokov, G. V. Safonov, Valerii B. Kudryavtsev

Publication date: 28 May 2021

Published in: Moscow University Mathematics Bulletin (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s0027132220040051

zbMATH Keywords

complexitydecompositionBoolean functionscommutative associative operations

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Theoretical computer science. 6th GI-Conference, Dortmund, January 5-7, 1983
• Bemerkung zur vorstehenden Arbeit von Herrn Chevalley
• Advances in cryptology -- EUROCRYPT 2004. International conference on the theory and applications of cryptographic techniques, Interlaken, Switzerland, May 2--6, 2004. Proceedings.
• The predicate method to construct the Post lattice
• Combinatorial Nullstellensatz
• The complexity of theorem-proving procedures

This page was built for publication: On irreduceability of Boolean functions with respect to commutative associative operation