Iterated Boolean functions in the elementary basis

DOI10.3103/S1066369X11110089MaRDI QIDQ1759196zbMATH OpenOpenAlexFDO

Authors A. A. Voronenko, V. S. Fedorova, Dmitry Chistikov

Publication date 20 November 2012

Published in Russian Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

read-once Boolean function

Mathematics Subject Classification ID

Switching theory, applications of Boolean algebras to circuits and networks (94C11) Boolean functions (06E30) Boolean functions (94D10)

Recommendations

• On read-once Boolean functions in elementary base extended by median
• Construction of noniterated Boolean functions in the basis \(\{\& ,\vee ,-\}\) and estimation of their number
• A new proof of Stetsenko's theorem
• Read-once functions of the algebra of logic in pre-elementary bases
• Functions that are read-once on a subset of their inputs

Cited in

(9)

• scientific article; zbMATH DE number 3922733 (Why is no real title available?)
• On the length of a read-many certificate in certain extended elementary bases
• scientific article; zbMATH DE number 4068779 (Why is no real title available?)
• A new proof of Stetsenko's theorem
• scientific article; zbMATH DE number 1759421 (Why is no real title available?)
• The length of a read-many certificate in the basis of all functions of \(l\) variables
• On read-once Boolean functions in elementary base extended by median
• On the Shannon function for read-many certificate length in a family of bases
• Read-once functions of the algebra of logic in pre-elementary bases

This page was built for publication: Iterated Boolean functions in the elementary basis

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