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

DOI10.1515/dma-2017-0006zbMath1393.06015OpenAlexW1971689940MaRDI QIDQ1675524

Vitaliy A. Voblyi

Publication date: 2 November 2017

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma-2017-0006

zbMATH Keywords

asymptoticsenumerationrepetition-free Boolean function

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Refined estimates of the number of repetition-free Boolean functions in the full binary basis \(\{\&,\vee,\oplus,-\}\)
• The asymptotics of the number of repetition-free Boolean functions in the basis B 1