Geodesic
Lower bounds of temporal and spatial complexity of the substring search problem
Diskretnaya Matematika, Tome 26 (2014) no. 2, pp. 58-70

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

@article{DM_2014_26_2_a4,
     author = {E. M. Perper},
     title = {Lower bounds of temporal and spatial complexity of the substring search problem},
     journal = {Diskretnaya Matematika},
     pages = {58--70},
     publisher = {mathdoc},
     volume = {26},
     number = {2},
     year = {2014},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2014_26_2_a4/}
}
TY  - JOUR
AU  - E. M. Perper
TI  - Lower bounds of temporal and spatial complexity of the substring search problem
JO  - Diskretnaya Matematika
PY  - 2014
SP  - 58
EP  - 70
VL  - 26
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_2014_26_2_a4/
LA  - ru
ID  - DM_2014_26_2_a4
ER  - 
%0 Journal Article
%A E. M. Perper
%T Lower bounds of temporal and spatial complexity of the substring search problem
%J Diskretnaya Matematika
%D 2014
%P 58-70
%V 26
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_2014_26_2_a4/
%G ru
%F DM_2014_26_2_a4
E. M. Perper. Lower bounds of temporal and spatial complexity of the substring search problem. Diskretnaya Matematika, Tome 26 (2014) no. 2, pp. 58-70. http://geodesic.mathdoc.fr/item/DM_2014_26_2_a4/