Geodesic
On the length of a checking sequence for repetition-free functions in the basis $\{0,1,\,\vee,\neg\}$
Diskretnaya Matematika, Tome 17 (2005) no. 2, pp. 139-143

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

In this paper, we present upper and lower linear bounds for the Shannon function for length of checking tests for repetition-free functions in the basis $\{0,1,\,\vee,\neg\}$. The research was supported by Russian Foundation for Basic Research, grants 04–01–00359 and 05–01–01000. 
@article{DM_2005_17_2_a10,
     author = {A. A. Voronenko},
     title = {On the length of a checking sequence for repetition-free functions in the basis $\{0,1,\&,\vee,\neg\}$},
     journal = {Diskretnaya Matematika},
     pages = {139--143},
     publisher = {mathdoc},
     volume = {17},
     number = {2},
     year = {2005},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2005_17_2_a10/}
}
TY  - JOUR
AU  - A. A. Voronenko
TI  - On the length of a checking sequence for repetition-free functions in the basis $\{0,1,\&,\vee,\neg\}$
JO  - Diskretnaya Matematika
PY  - 2005
SP  - 139
EP  - 143
VL  - 17
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_2005_17_2_a10/
LA  - ru
ID  - DM_2005_17_2_a10
ER  - 
%0 Journal Article
%A A. A. Voronenko
%T On the length of a checking sequence for repetition-free functions in the basis $\{0,1,\&,\vee,\neg\}$
%J Diskretnaya Matematika
%D 2005
%P 139-143
%V 17
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_2005_17_2_a10/
%G ru
%F DM_2005_17_2_a10
A. A. Voronenko. On the length of a checking sequence for repetition-free functions in the basis $\{0,1,\&,\vee,\neg\}$. Diskretnaya Matematika, Tome 17 (2005) no. 2, pp. 139-143. http://geodesic.mathdoc.fr/item/DM_2005_17_2_a10/