Geodesic
Impossibility of eliminating complete enumeration in computing functions from their diagrams
Doklady Akademii Nauk, Tome 189 (1969) no. 4, pp. 748-751.

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

@article{DAN_1969_189_4_a14,
     author = {M. I. Dekhtyar'},
     title = {Impossibility of eliminating complete enumeration in computing functions from their diagrams},
     journal = {Doklady Akademii Nauk},
     pages = {748--751},
     publisher = {mathdoc},
     volume = {189},
     number = {4},
     year = {1969},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DAN_1969_189_4_a14/}
}
TY  - JOUR
AU  - M. I. Dekhtyar'
TI  - Impossibility of eliminating complete enumeration in computing functions from their diagrams
JO  - Doklady Akademii Nauk
PY  - 1969
SP  - 748
EP  - 751
VL  - 189
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DAN_1969_189_4_a14/
LA  - ru
ID  - DAN_1969_189_4_a14
ER  - 
%0 Journal Article
%A M. I. Dekhtyar'
%T Impossibility of eliminating complete enumeration in computing functions from their diagrams
%J Doklady Akademii Nauk
%D 1969
%P 748-751
%V 189
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DAN_1969_189_4_a14/
%G ru
%F DAN_1969_189_4_a14
M. I. Dekhtyar'. Impossibility of eliminating complete enumeration in computing functions from their diagrams. Doklady Akademii Nauk, Tome 189 (1969) no. 4, pp. 748-751. http://geodesic.mathdoc.fr/item/DAN_1969_189_4_a14/