Geodesic
Estimatiing complexity of directed enumeration in non-uniformly distributed key spaces
Prikladnaâ diskretnaâ matematika, no. 12 (2010), pp. 88-90

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

Some upper bounds are given for the complexity of enumerating elements in non-uniformly distributed key spaces. 
@article{PDM_2010_12_a44,
     author = {I. V. Pankratov and O. A. Teploukhova},
     title = {Estimatiing complexity of directed enumeration in non-uniformly distributed key spaces},
     journal = {Prikladna\^a diskretna\^a matematika},
     pages = {88--90},
     publisher = {mathdoc},
     number = {12},
     year = {2010},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDM_2010_12_a44/}
}
TY  - JOUR
AU  - I. V. Pankratov
AU  - O. A. Teploukhova
TI  - Estimatiing complexity of directed enumeration in non-uniformly distributed key spaces
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2010
SP  - 88
EP  - 90
IS  - 12
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDM_2010_12_a44/
LA  - ru
ID  - PDM_2010_12_a44
ER  - 
%0 Journal Article
%A I. V. Pankratov
%A O. A. Teploukhova
%T Estimatiing complexity of directed enumeration in non-uniformly distributed key spaces
%J Prikladnaâ diskretnaâ matematika
%D 2010
%P 88-90
%N 12
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDM_2010_12_a44/
%G ru
%F PDM_2010_12_a44
I. V. Pankratov; O. A. Teploukhova. Estimatiing complexity of directed enumeration in non-uniformly distributed key spaces. Prikladnaâ diskretnaâ matematika, no. 12 (2010), pp. 88-90. http://geodesic.mathdoc.fr/item/PDM_2010_12_a44/