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

DOI10.1134/S0001434607110181zbMATH Open1143.05006OpenAlexW2083256715MaRDI QIDQ941908FDOQ941908

Authors: O. V. Zubkov 

Publication date: 2 September 2008

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

Full work available at URL: https://doi.org/10.1134/s0001434607110181

Recommendations

• The asymptotics of the number of repetition-free Boolean functions in the basis \(B_1\)
• 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
• Refined estimates of the number of repetition-free Boolean functions in the full binary basis \(\{\&,\vee,\oplus,-\}\)
• scientific article; zbMATH DE number 2047490
• On repetition-free Boolean functions over pre-elementary monotone bases
• Asymptotics for the complexity of Boolean functions with small number of ones
• On realization of Boolean functions by repetition-free formulas
• Realization of Boolean functions by repetition-free formulas in a particular base
• scientific article; zbMATH DE number 5061984

zbMATH Keywords

Euler numberimproper integralrepetition-free Boolean functionstirling number of the second kindtwo-pole serial set

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Boolean functions (06E30)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Selected problems in the theory of Boolean functions. Ed. by S. F. Vinokurov and N. A. Peryazev.

Cited In (5)

• 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\)
• Finding and estimating the number of repetition-free Boolean functions over the elementary basis in the form of a convergent series
• Linear recurrences and asymptotic behavior of exponential sums of symmetric Boolean functions
• Refined estimates of the number of repetition-free Boolean functions in the full binary basis \(\{\&,\vee,\oplus,-\}\)

This page was built for publication: Asymptotics of the number of repetition-free Boolean functions in the elementary basis

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