Asymptotically minimal schemes for one sequence of Boolean functions

DOI10.3103/S027864190903008XMaRDI QIDQ735559zbMATH OpenFDO

Authors T. I. Krasnova

Publication date 23 October 2009

Published in Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)

zbMATH Keywords

schemes of functional elementscomplexity of a schememonotone symmetric Boolean functions

Mathematics Subject Classification ID

Recommendations

• On asymptotically minimal self-correcting schemes for a sequence of Boolean functions
• scientific article; zbMATH DE number 942481
• Asymptotically optimal Boolean functions
• Asymptotics for the complexity of Boolean functions with small number of ones
• On minimal \(\pi\)-schemes for linear Boolean functions
• On minimal realizations of linear Boolean functions
• scientific article; zbMATH DE number 6004901
• scientific article; zbMATH DE number 1285548
• scientific article; zbMATH DE number 2210682
• scientific article; zbMATH DE number 3894979

Cited in

(6)

• scientific article; zbMATH DE number 6460060 (Why is no real title available?)
• scientific article; zbMATH DE number 942481 (Why is no real title available?)
• Upper bounds for the complexity of sequences generated by symmetric Boolean functions
• Asymptotics for the complexity of Boolean functions with small number of ones
• scientific article; zbMATH DE number 4074960 (Why is no real title available?)
• Inversion complexity of self-correcting circuits for a certain sequence of Boolean functions

This page was built for publication: Asymptotically minimal schemes for one sequence of Boolean functions

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