Geodesic
A~lower bound on the complexity of information networks for a~class of information search problems
Diskretnaya Matematika, Tome 4 (1992) no. 3, pp. 118-127.

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

In a special class of control systems, called information networks, we study a class of information search problems in which the measure of the set of queries, containing more than one element as an answer to a search problem, is equal to 0. For a narrower class of problems we obtain a lower bound, a logarithm of the number of elements in a data base, on the complexity of information networks. 
@article{DM_1992_4_3_a9,
     author = {\`E. \`E. Gasanov},
     title = {A~lower bound on the complexity of information networks for a~class of information search problems},
     journal = {Diskretnaya Matematika},
     pages = {118--127},
     publisher = {mathdoc},
     volume = {4},
     number = {3},
     year = {1992},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_1992_4_3_a9/}
}
TY  - JOUR
AU  - È. È. Gasanov
TI  - A~lower bound on the complexity of information networks for a~class of information search problems
JO  - Diskretnaya Matematika
PY  - 1992
SP  - 118
EP  - 127
VL  - 4
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_1992_4_3_a9/
LA  - ru
ID  - DM_1992_4_3_a9
ER  - 
%0 Journal Article
%A È. È. Gasanov
%T A~lower bound on the complexity of information networks for a~class of information search problems
%J Diskretnaya Matematika
%D 1992
%P 118-127
%V 4
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_1992_4_3_a9/
%G ru
%F DM_1992_4_3_a9
È. È. Gasanov. A~lower bound on the complexity of information networks for a~class of information search problems. Diskretnaya Matematika, Tome 4 (1992) no. 3, pp. 118-127. http://geodesic.mathdoc.fr/item/DM_1992_4_3_a9/