Finding and estimating the number of repetition-free Boolean functions over the elementary basis in the form of a convergent series

DOI10.1515/DMA.2009.033zbMath1243.06012OpenAlexW2085291323MaRDI QIDQ3225891

Oleg Vladimirovich Zubkov

Publication date: 23 March 2012

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

Full work available at URL: https://doi.org/10.1515/dma.2009.033

zbMATH Keywords

repetition-free Boolean functionsexponential power series

Mathematics Subject Classification ID

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

Cites Work

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

This page was built for publication: Finding and estimating the number of repetition-free Boolean functions over the elementary basis in the form of a convergent series