On the existence of optimal algorithms for combinatorial problems and languages
Trudy Matematicheskogo Instituta imeni V.A. Steklova, Tome 35 (1980) no. 5, pp. 249-250
Voir la notice de l'article provenant de la source Math-Net.Ru
@article{RM_1980_35_5_a5,
author = {M. Kh. Aizenshtein},
title = {On the existence of optimal algorithms for combinatorial problems and languages},
journal = {Trudy Matematicheskogo Instituta imeni V.A. Steklova},
pages = {249--250},
publisher = {mathdoc},
volume = {35},
number = {5},
year = {1980},
language = {en},
url = {http://geodesic.mathdoc.fr/item/RM_1980_35_5_a5/}
}
TY - JOUR AU - M. Kh. Aizenshtein TI - On the existence of optimal algorithms for combinatorial problems and languages JO - Trudy Matematicheskogo Instituta imeni V.A. Steklova PY - 1980 SP - 249 EP - 250 VL - 35 IS - 5 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/RM_1980_35_5_a5/ LA - en ID - RM_1980_35_5_a5 ER -
M. Kh. Aizenshtein. On the existence of optimal algorithms for combinatorial problems and languages. Trudy Matematicheskogo Instituta imeni V.A. Steklova, Tome 35 (1980) no. 5, pp. 249-250. http://geodesic.mathdoc.fr/item/RM_1980_35_5_a5/