RUS  ENG
Full version
JOURNALS // Diskretnaya Matematika // Archive

Diskr. Mat., 2008 Volume 20, Issue 4, Pages 85–88 (Mi dm1028)

This article is cited in 1 paper

A lower bound for the affinity level for almost all Boolean functions

O. A. Logachev


Abstract: We consider the behaviour of the affinity level of the Boolean functions. It is shown that, as $n\to\infty$, almost all Boolean functions of $n$ variables have the affinity level exceeding $n-2\log_2n$.

UDC: 519.7

Received: 15.06.2007

DOI: 10.4213/dm1028


 English version:
Discrete Mathematics and Applications, 2008, 18:5, 553–556

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025