Geodesic
On the algorithmic complexity of discrete functions
Doklady Akademii Nauk, Tome 145 (1962) no. 1, pp. 48-51.

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

@article{DAN_1962_145_1_a11,
     author = {Yu. Ofman},
     title = {On the algorithmic complexity of discrete functions},
     journal = {Doklady Akademii Nauk},
     pages = {48--51},
     publisher = {mathdoc},
     volume = {145},
     number = {1},
     year = {1962},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DAN_1962_145_1_a11/}
}
TY  - JOUR
AU  - Yu. Ofman
TI  - On the algorithmic complexity of discrete functions
JO  - Doklady Akademii Nauk
PY  - 1962
SP  - 48
EP  - 51
VL  - 145
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DAN_1962_145_1_a11/
LA  - ru
ID  - DAN_1962_145_1_a11
ER  - 
%0 Journal Article
%A Yu. Ofman
%T On the algorithmic complexity of discrete functions
%J Doklady Akademii Nauk
%D 1962
%P 48-51
%V 145
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DAN_1962_145_1_a11/
%G ru
%F DAN_1962_145_1_a11
Yu. Ofman. On the algorithmic complexity of discrete functions. Doklady Akademii Nauk, Tome 145 (1962) no. 1, pp. 48-51. http://geodesic.mathdoc.fr/item/DAN_1962_145_1_a11/