Refined estimates of the number of repetition-free Boolean functions in the full binary basis \(\{\&,\vee,\oplus,-\}\)

DOI10.1134/S0001434610050081zbMath1283.06026MaRDI QIDQ368209

Oleg Vladimirovich Zubkov

Publication date: 18 September 2013

Published in: Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

Fibonacci numbersEuler numbersbinary functionfull binary basisindex-preserving structurerepetition-free Boolean function

Mathematics Subject Classification ID

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

Related Items (1)

On the asymptotics of the number of repetition-free Boolean functions in the basis \(\{\&, \vee, \otimes, \neg\}\)

Cites Work

• Unnamed Item
• Unnamed Item
• Asymptotics of the number of repetition-free Boolean functions in the elementary basis

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