Refined estimates of the number of repetition-free Boolean functions in the full binary basis \\&,,,-\
From MaRDI portal
Publication:368209
DOI10.1134/S0001434610050081zbMATH Open1283.06026MaRDI QIDQ368209FDOQ368209
Authors: O. V. Zubkov
Publication date: 18 September 2013
Published in: Mathematical Notes (Search for Journal in Brave)
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
Euler numbersFibonacci numbersbinary functionfull binary basisindex-preserving structurerepetition-free Boolean function
Cites Work
Cited In (7)
- On the asymptotics of the number of repetition-free Boolean functions in the basis \(\{\&, \vee, \otimes, \neg\}\)
- The asymptotics of the number of repetition-free Boolean functions in the basis \(B_1\)
- Title not available (Why is that?)
- Finding and estimating the number of repetition-free Boolean functions over the elementary basis in the form of a convergent series
- Construction of noniterated Boolean functions in the basis \(\{\& ,\vee ,-\}\) and estimation of their number
- Title not available (Why is that?)
- 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,-\}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q368209)