Refined estimates of the number of repetition-free Boolean functions in the full binary basis \\&,,,-\

DOI10.1134/S0001434610050081MaRDI QIDQ368209zbMATH OpenFDO

Authors O. V. Zubkov

Publication date 18 September 2013

Published in Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

Euler numbersFibonacci numbersbinary functionfull binary basisindex-preserving structurerepetition-free Boolean function

Mathematics Subject Classification ID

Asymptotic enumeration (05A16) Boolean functions (06E30)

Recommendations

• On the asymptotics of the number of repetition-free Boolean functions in the basis \(\{\&, \vee, \otimes, \neg\}\)
• Finding and estimating the number of repetition-free Boolean functions over the elementary basis in the form of a convergent series
• Asymptotics of the number of repetition-free Boolean functions in the elementary basis
• The asymptotics of the number of repetition-free Boolean functions in the basis \(B_1\)
• scientific article; zbMATH DE number 2047490

Cites work

• scientific article; zbMATH DE number 2047490 (Why is no real title available?)
• Asymptotics of the number of repetition-free Boolean functions in the elementary basis
• Selected problems in the theory of Boolean functions. Ed. by S. F. Vinokurov and N. A. Peryazev.

Cited in

(7)

• Finding and estimating the number of repetition-free Boolean functions over the elementary basis in the form of a convergent series
• On the asymptotics of the number of repetition-free Boolean functions in the basis \(\{\&, \vee, \otimes, \neg\}\)
• scientific article; zbMATH DE number 2047490 (Why is no real title available?)
• Construction of noniterated Boolean functions in the basis \(\{\& ,\vee ,-\}\) and estimation of their number
• Asymptotics of the number of repetition-free Boolean functions in the elementary basis
• scientific article; zbMATH DE number 139640 (Why is no real title available?)
• The asymptotics of the number of repetition-free Boolean functions in the basis \(B_1\)

This page was built for publication: Refined estimates of the number of repetition-free Boolean functions in the full binary basis \(\{\&,\vee,\oplus,-\}\)

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