Trudy po diskretnoj matematike, Trudy po Diskretnoi Matematike, Tome 10 (2007), pp. 239-268
Citer cet article
S. V. Polin. Some algorithmic questions connected with the solution of the search problem without a clear criteria for checking the validity of a variant. Trudy po diskretnoj matematike, Trudy po Diskretnoi Matematike, Tome 10 (2007), pp. 239-268. http://geodesic.mathdoc.fr/item/TDM_2007_10_a12/
@article{TDM_2007_10_a12,
author = {S. V. Polin},
title = {Some algorithmic questions connected with the solution of the search problem without a clear criteria for checking the validity of a variant},
journal = {Trudy po diskretnoj matematike},
pages = {239--268},
year = {2007},
volume = {10},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/TDM_2007_10_a12/}
}
TY - JOUR
AU - S. V. Polin
TI - Some algorithmic questions connected with the solution of the search problem without a clear criteria for checking the validity of a variant
JO - Trudy po diskretnoj matematike
PY - 2007
SP - 239
EP - 268
VL - 10
UR - http://geodesic.mathdoc.fr/item/TDM_2007_10_a12/
LA - ru
ID - TDM_2007_10_a12
ER -
%0 Journal Article
%A S. V. Polin
%T Some algorithmic questions connected with the solution of the search problem without a clear criteria for checking the validity of a variant
%J Trudy po diskretnoj matematike
%D 2007
%P 239-268
%V 10
%U http://geodesic.mathdoc.fr/item/TDM_2007_10_a12/
%G ru
%F TDM_2007_10_a12