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

DOI10.1134/S0001434607110181zbMath1143.05006OpenAlexW2083256715MaRDI QIDQ941908

Oleg Vladimirovich 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

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)

Related Items (2)

Refined estimates of the number of repetition-free Boolean functions in the full binary basis \(\{\&,\vee,\oplus,-\}\) ⋮ Finding and estimating the number of repetition-free Boolean functions over the elementary basis in the form of a convergent series

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item

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