Zapiski Nauchnykh Seminarov POMI, Studies in constructive mathematics and mathematical logic. Part III, Tome 16 (1969), pp. 165-174
Citer cet article
N. V. Petri. Two theorems on the complexity of algorithms and computations. Zapiski Nauchnykh Seminarov POMI, Studies in constructive mathematics and mathematical logic. Part III, Tome 16 (1969), pp. 165-174. http://geodesic.mathdoc.fr/item/ZNSL_1969_16_a18/
@article{ZNSL_1969_16_a18,
author = {N. V. Petri},
title = {Two theorems on the complexity of algorithms and computations},
journal = {Zapiski Nauchnykh Seminarov POMI},
pages = {165--174},
year = {1969},
volume = {16},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ZNSL_1969_16_a18/}
}
TY - JOUR
AU - N. V. Petri
TI - Two theorems on the complexity of algorithms and computations
JO - Zapiski Nauchnykh Seminarov POMI
PY - 1969
SP - 165
EP - 174
VL - 16
UR - http://geodesic.mathdoc.fr/item/ZNSL_1969_16_a18/
LA - ru
ID - ZNSL_1969_16_a18
ER -
%0 Journal Article
%A N. V. Petri
%T Two theorems on the complexity of algorithms and computations
%J Zapiski Nauchnykh Seminarov POMI
%D 1969
%P 165-174
%V 16
%U http://geodesic.mathdoc.fr/item/ZNSL_1969_16_a18/
%G ru
%F ZNSL_1969_16_a18
