Finding and estimating the number of repetition-free Boolean functions over the elementary basis in the form of a convergent series
From MaRDI portal
Publication:3225891
DOI10.1515/DMA.2009.033zbMath1243.06012OpenAlexW2085291323MaRDI QIDQ3225891
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
Cites Work
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