Geodesic
The complexity of the enumeration and solvability of predicates
Doklady Akademii Nauk, Tome 190 (1970) no. 1, pp. 23-26 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{DAN_1970_190_1_a4,
     author = {M. I. Kanovich},
     title = {The complexity of the enumeration and solvability of predicates},
     journal = {Doklady Akademii Nauk},
     pages = {23--26},
     year = {1970},
     volume = {190},
     number = {1},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DAN_1970_190_1_a4/}
}
TY  - JOUR
AU  - M. I. Kanovich
TI  - The complexity of the enumeration and solvability of predicates
JO  - Doklady Akademii Nauk
PY  - 1970
SP  - 23
EP  - 26
VL  - 190
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/DAN_1970_190_1_a4/
LA  - ru
ID  - DAN_1970_190_1_a4
ER  - 
%0 Journal Article
%A M. I. Kanovich
%T The complexity of the enumeration and solvability of predicates
%J Doklady Akademii Nauk
%D 1970
%P 23-26
%V 190
%N 1
%U http://geodesic.mathdoc.fr/item/DAN_1970_190_1_a4/
%G ru
%F DAN_1970_190_1_a4
M. I. Kanovich. The complexity of the enumeration and solvability of predicates. Doklady Akademii Nauk, Tome 190 (1970) no. 1, pp. 23-26. http://geodesic.mathdoc.fr/item/DAN_1970_190_1_a4/