2010
DOI: 10.1515/dma.2010.029
|View full text |Cite
|
Sign up to set email alerts
|

Bounds for the number of Boolean functions admitting affine approximations of a given accuracy

Abstract: We obtain two-sided bounds and asymptotic formulas for the number of Boolean functions of n variables which are approximated by affine or linear Boolean functions with a given accuracy.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2011
2011
2023
2023

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 9 publications
(2 citation statements)
references
References 3 publications
0
2
0
Order By: Relevance
“…Thus, the estimate (3.3) is non-improvable; cf. [1], [11], [14], [15]. Another generalizations of the equality (2.2), for example, on the Hoeffding's inequality and on the theory of martingales see in the article of M.Raginsky and I.Sason [12].…”
Section: Resultsmentioning
confidence: 99%
“…Thus, the estimate (3.3) is non-improvable; cf. [1], [11], [14], [15]. Another generalizations of the equality (2.2), for example, on the Hoeffding's inequality and on the theory of martingales see in the article of M.Raginsky and I.Sason [12].…”
Section: Resultsmentioning
confidence: 99%
“…Theorem 1, as the result of Ryasanov [5], concerns the "central" parts of distributions of ρ(f, An) and ρ(f, Ln). It was proved in [7] that in the domains of "large deviations" (when x → −∞ as n → ∞) the right-hand sides of (1) and (2) are incorrect asymptotics of probabilities in their left-hand sides.…”
Section: Remarkmentioning
confidence: 99%