Construction of noniterated Boolean functions in the basis \\& , ,-\ and estimation of their number

DOI10.3103/S1066369X08100022zbMATH Open1182.06006MaRDI QIDQ735905FDOQ735905

Authors: O. V. Zubkov 

Publication date: 26 October 2009

Published in: Russian Mathematics (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 2047490
• Refined estimates of the number of repetition-free Boolean functions in the full binary basis \(\{\&,\vee,\oplus,-\}\)
• On the asymptotics of the number of repetition-free Boolean functions in the basis \(\{\&, \vee, \otimes, \neg\}\)
• Exact value of the nonmonotone complexity of Boolean functions
• Realization of Boolean functions by formulas in continuous bases containing a continuum of constants

zbMATH Keywords

estimates for the number of noniterated functionsnoniterated Boolean function

Mathematics Subject Classification ID

Boolean functions (06E30)

Cited In (2)

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

This page was built for publication: Construction of noniterated Boolean functions in the basis \(\{\& ,\vee ,-\}\) and estimation of their number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q735905)