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 Edit this on Wikidata


Publication date: 18 September 2013

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





Recommendations




Cites Work


Cited In (7)





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)