Doklady Akademii Nauk, Tome 191 (1970) no. 5, pp. 1004-1006
Citer cet article
V. I. Khomich. The complexity of the algorithms that are connected with the realization of logico-arithmetical and propositional formulae. Doklady Akademii Nauk, Tome 191 (1970) no. 5, pp. 1004-1006. http://geodesic.mathdoc.fr/item/DAN_1970_191_5_a11/
@article{DAN_1970_191_5_a11,
author = {V. I. Khomich},
title = {The complexity of the algorithms that are connected with the realization of logico-arithmetical and propositional formulae},
journal = {Doklady Akademii Nauk},
pages = {1004--1006},
year = {1970},
volume = {191},
number = {5},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/DAN_1970_191_5_a11/}
}
TY - JOUR
AU - V. I. Khomich
TI - The complexity of the algorithms that are connected with the realization of logico-arithmetical and propositional formulae
JO - Doklady Akademii Nauk
PY - 1970
SP - 1004
EP - 1006
VL - 191
IS - 5
UR - http://geodesic.mathdoc.fr/item/DAN_1970_191_5_a11/
LA - ru
ID - DAN_1970_191_5_a11
ER -
%0 Journal Article
%A V. I. Khomich
%T The complexity of the algorithms that are connected with the realization of logico-arithmetical and propositional formulae
%J Doklady Akademii Nauk
%D 1970
%P 1004-1006
%V 191
%N 5
%U http://geodesic.mathdoc.fr/item/DAN_1970_191_5_a11/
%G ru
%F DAN_1970_191_5_a11
