Geodesic
Algorithm of searching a minimal set which contains a true solution with a given probability
Trudy po diskretnoj matematike, Trudy po Diskretnoi Matematike, Tome 7 (2003), pp. 7-21 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice du chapitre de livre

@article{TDM_2003_7_a0,
     author = {G. V. Balakin},
     title = {Algorithm of searching a minimal set which contains a true solution with a given probability},
     journal = {Trudy po diskretnoj matematike},
     pages = {7--21},
     year = {2003},
     volume = {7},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/TDM_2003_7_a0/}
}
TY  - JOUR
AU  - G. V. Balakin
TI  - Algorithm of searching a minimal set which contains a true solution with a given probability
JO  - Trudy po diskretnoj matematike
PY  - 2003
SP  - 7
EP  - 21
VL  - 7
UR  - http://geodesic.mathdoc.fr/item/TDM_2003_7_a0/
LA  - ru
ID  - TDM_2003_7_a0
ER  - 
%0 Journal Article
%A G. V. Balakin
%T Algorithm of searching a minimal set which contains a true solution with a given probability
%J Trudy po diskretnoj matematike
%D 2003
%P 7-21
%V 7
%U http://geodesic.mathdoc.fr/item/TDM_2003_7_a0/
%G ru
%F TDM_2003_7_a0
G. V. Balakin. Algorithm of searching a minimal set which contains a true solution with a given probability. Trudy po diskretnoj matematike, Trudy po Diskretnoi Matematike, Tome 7 (2003), pp. 7-21. http://geodesic.mathdoc.fr/item/TDM_2003_7_a0/