A simplified proof of a~lower complexity estimate
Diskretnaya Matematika, Tome 25 (2013) no. 2, pp. 82-84.

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

@article{DM_2013_25_2_a7,
     author = {V. M. Khrapchenko},
     title = {A simplified proof of a~lower complexity estimate},
     journal = {Diskretnaya Matematika},
     pages = {82--84},
     publisher = {mathdoc},
     volume = {25},
     number = {2},
     year = {2013},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2013_25_2_a7/}
}
TY  - JOUR
AU  - V. M. Khrapchenko
TI  - A simplified proof of a~lower complexity estimate
JO  - Diskretnaya Matematika
PY  - 2013
SP  - 82
EP  - 84
VL  - 25
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_2013_25_2_a7/
LA  - ru
ID  - DM_2013_25_2_a7
ER  - 
%0 Journal Article
%A V. M. Khrapchenko
%T A simplified proof of a~lower complexity estimate
%J Diskretnaya Matematika
%D 2013
%P 82-84
%V 25
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_2013_25_2_a7/
%G ru
%F DM_2013_25_2_a7
V. M. Khrapchenko. A simplified proof of a~lower complexity estimate. Diskretnaya Matematika, Tome 25 (2013) no. 2, pp. 82-84. http://geodesic.mathdoc.fr/item/DM_2013_25_2_a7/

[1] Khrapchenko V. M., “Ob odnom metode polucheniya nizhnikh otsenok slozhnosti $\Pi$-skhem”, Matem. zametki, 10:1 (1971), 83–92 | MR | Zbl

[2] Rychkov K. L., “Modifikatsiya metoda V. M. Khrapchenko i ego primenenie k otsenke slozhnosti $\Pi$-skhem dlya kodovykh funktsii”, Metody diskretnogo analiza v teorii grafov i skhem, 42, IM SO AN SSSR, Novosibirsk, 1985, 91–98 | MR

[3] Khrapchenko V. M., “O slozhnosti realizatsii lineinoi funktsii v klasse $\Pi$-skhem”, Matem. zametki, 9:1 (1971), 35–40 | MR | Zbl