Geodesic
Nonlinearity statistical properties of Boolean function restrictions on a randomly chosen subspace
Prikladnaâ diskretnaâ matematika, no. 1 (2012), pp. 5-10
Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

It is shown that for all sufficiently large natural $n$, the relative nonlinearity of any Boolean function in $n$ variables can be statistically approximated by the relative nonlinearity of its restriction on a random subspace (possibly without the zero vector), whose dimension is independent on $n$.
Keywords: Boolean functions, nonlinearity, random subspace, statistical estimation. 
@article{PDM_2012_1_a0,
     author = {A. N. Alekseychuk and S. N. Konyushok},
     title = {Nonlinearity statistical properties of {Boolean} function restrictions on a~randomly chosen subspace},
     journal = {Prikladna\^a diskretna\^a matematika},
     pages = {5--10},
     year = {2012},
     number = {1},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDM_2012_1_a0/}
}
TY  - JOUR
AU  - A. N. Alekseychuk
AU  - S. N. Konyushok
TI  - Nonlinearity statistical properties of Boolean function restrictions on a randomly chosen subspace
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2012
SP  - 5
EP  - 10
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/PDM_2012_1_a0/
LA  - ru
ID  - PDM_2012_1_a0
ER  - 
%0 Journal Article
%A A. N. Alekseychuk
%A S. N. Konyushok
%T Nonlinearity statistical properties of Boolean function restrictions on a randomly chosen subspace
%J Prikladnaâ diskretnaâ matematika
%D 2012
%P 5-10
%N 1
%U http://geodesic.mathdoc.fr/item/PDM_2012_1_a0/
%G ru
%F PDM_2012_1_a0
A. N. Alekseychuk; S. N. Konyushok. Nonlinearity statistical properties of Boolean function restrictions on a randomly chosen subspace. Prikladnaâ diskretnaâ matematika, no. 1 (2012), pp. 5-10. http://geodesic.mathdoc.fr/item/PDM_2012_1_a0/

[1] Logachev O. A., Salnikov A. A., Yaschenko V. V., Bulevy funktsii v teorii kodirovaniya i kriptologii, MTsNMO, M., 2004, 470 pp. | MR

[2] Levin L. A., “Randomness and non-determinism”, J. Symbolic Logic, 58:3 (1993), 1102–1103

[3] Bshouty N., Jackson J., Tamon C., “More efficient PAC-learning of DNF with membership queries under the uniform distribution”, Proc. 12th Annual Conf. on Comput. Learning Theory, ACM, NY, USA, 1999, 286–295 | MR

[4] Gopalan P., O'Donnell R., Servedio A. et al., “Testing Fourier dimensionality and sparsity”, SIAM J. Comput., 40:4 (2011), 1075–1100 | DOI | MR | Zbl

[5] Alekseichuk A. N., Shevtsov A. S., “Bystryi algoritm statisticheskogo otsenivaniya maksimalnoi nesbalansirovannosti bilineinykh approksimatsii bulevykh otobrazhenii”, Prikladnaya diskretnaya matematika, 2011, no. 3(13), 5–11