Geodesic
A lower bound for the complexity of inclusive search in the class of tree-like circuits
Diskretnaya Matematika, Tome 10 (1998) no. 1, pp. 63-72
Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

In the class of tree information networks with a base set of variables we give examples of inclusive search problems such that the order of magnitude of lower bounds for their complexity exceeds the average time of solution output.This research was supported by the Russian Foundation for Basic Research, grant 95–01–00597. 
@article{DM_1998_10_1_a5,
     author = {\`E. \`E. Gasanov},
     title = {A lower bound for the complexity of inclusive search in the class of tree-like circuits},
     journal = {Diskretnaya Matematika},
     pages = {63--72},
     year = {1998},
     volume = {10},
     number = {1},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_1998_10_1_a5/}
}
TY  - JOUR
AU  - È. È. Gasanov
TI  - A lower bound for the complexity of inclusive search in the class of tree-like circuits
JO  - Diskretnaya Matematika
PY  - 1998
SP  - 63
EP  - 72
VL  - 10
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/DM_1998_10_1_a5/
LA  - ru
ID  - DM_1998_10_1_a5
ER  - 
%0 Journal Article
%A È. È. Gasanov
%T A lower bound for the complexity of inclusive search in the class of tree-like circuits
%J Diskretnaya Matematika
%D 1998
%P 63-72
%V 10
%N 1
%U http://geodesic.mathdoc.fr/item/DM_1998_10_1_a5/
%G ru
%F DM_1998_10_1_a5
È. È. Gasanov. A lower bound for the complexity of inclusive search in the class of tree-like circuits. Diskretnaya Matematika, Tome 10 (1998) no. 1, pp. 63-72. http://geodesic.mathdoc.fr/item/DM_1998_10_1_a5/