Geodesic
On the average monotone complexity of Boolean functions
Diskretnyj analiz i issledovanie operacij, Tome 11 (2004) no. 4, pp. 68-80.

Voir la notice de l'article provenant de la source Math-Net.Ru

@article{DA_2004_11_4_a5,
     author = {A. V. Chashkin},
     title = {On the average monotone complexity of {Boolean} functions},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {68--80},
     publisher = {mathdoc},
     volume = {11},
     number = {4},
     year = {2004},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2004_11_4_a5/}
}
TY  - JOUR
AU  - A. V. Chashkin
TI  - On the average monotone complexity of Boolean functions
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2004
SP  - 68
EP  - 80
VL  - 11
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2004_11_4_a5/
LA  - ru
ID  - DA_2004_11_4_a5
ER  - 
%0 Journal Article
%A A. V. Chashkin
%T On the average monotone complexity of Boolean functions
%J Diskretnyj analiz i issledovanie operacij
%D 2004
%P 68-80
%V 11
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2004_11_4_a5/
%G ru
%F DA_2004_11_4_a5
A. V. Chashkin. On the average monotone complexity of Boolean functions. Diskretnyj analiz i issledovanie operacij, Tome 11 (2004) no. 4, pp. 68-80. http://geodesic.mathdoc.fr/item/DA_2004_11_4_a5/

[1] Chashkin A. V., “O srednem vremeni vychisleniya znachenii bulevykh funktsii”, Diskret. analiz i issled. operatsii. Ser. 1, 4:1 (1997), 60–78 | MR | Zbl

[2] Chashkin A. V., “O srednem vremeni vychisleniya bulevykh operatorov”, Diskret. analiz i issled. operatsii. Ser. 1, 5:1 (1998), 88–103 | MR | Zbl

[3] Chashkin A. V., “Srednee vremya vychisleniya znachenii elementarnykh bulevykh funktsii”, Diskretnaya matematika, 12:4 (2000), 109–120 | MR

[4] Sholomov L. A., “O realizatsii nedoopredelennykh bulevykh funktsii skhemami iz funktsionalnykh elementov”, Problemy kibernetiki, no. 21, Nauka, M., 1969, 215–226

[5] Ajtai M., Komlos Ja., Szemeredi E., “Sorting in $O(n\log n)$ parallel steps”, Combinatorica, 3:1 (1983), 1–19 | DOI | MR | Zbl

[6] Wegener I., The complexity of Boolean functions, John Wiley Sons, B. G. Teubner, Chechester, Stuttgart, 1987 | MR