Geodesic
On pre-bad Boolean bases
Diskretnaya Matematika, Tome 11 (1999) no. 2, pp. 118-160.

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

In the paper the complexity of realization of Boolean functions by formulas over various bases is investigated. In terms of the complexity of almost all Boolean functions, bases are, in a sense, equal in rights. At the same time, individual sequences of functions admit essentially simpler realization over some bases than over other ones.In this connection, of interest is such a method of comparison of bases which takes into account the complexity of realization of some individual sequences of functions. Such a method was proposed by O. B. Lupanov and then developed by B. A. Subbotovskaya and V. A. Stetsenko.The research was supported by the Russian Foundation for Basic Research, grant 99–01–01175, and also by Federal Program ‘State support for integration of higher education and fundamental science for 1997–2000’, grant 2.1–473. 
@article{DM_1999_11_2_a7,
     author = {D. Yu. Cherukhin},
     title = {On pre-bad {Boolean} bases},
     journal = {Diskretnaya Matematika},
     pages = {118--160},
     publisher = {mathdoc},
     volume = {11},
     number = {2},
     year = {1999},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_1999_11_2_a7/}
}
TY  - JOUR
AU  - D. Yu. Cherukhin
TI  - On pre-bad Boolean bases
JO  - Diskretnaya Matematika
PY  - 1999
SP  - 118
EP  - 160
VL  - 11
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_1999_11_2_a7/
LA  - ru
ID  - DM_1999_11_2_a7
ER  - 
%0 Journal Article
%A D. Yu. Cherukhin
%T On pre-bad Boolean bases
%J Diskretnaya Matematika
%D 1999
%P 118-160
%V 11
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_1999_11_2_a7/
%G ru
%F DM_1999_11_2_a7
D. Yu. Cherukhin. On pre-bad Boolean bases. Diskretnaya Matematika, Tome 11 (1999) no. 2, pp. 118-160. http://geodesic.mathdoc.fr/item/DM_1999_11_2_a7/