Geodesic
Some metric problems in the $n$-dimensional cube
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 42 (2002) no. 2, pp. 249-255 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{ZVMMF_2002_42_2_a8,
     author = {V. K. Leont'ev},
     title = {Some metric problems in the $n$-dimensional cube},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {249--255},
     year = {2002},
     volume = {42},
     number = {2},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_2002_42_2_a8/}
}
TY  - JOUR
AU  - V. K. Leont'ev
TI  - Some metric problems in the $n$-dimensional cube
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 2002
SP  - 249
EP  - 255
VL  - 42
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_2002_42_2_a8/
LA  - ru
ID  - ZVMMF_2002_42_2_a8
ER  - 
%0 Journal Article
%A V. K. Leont'ev
%T Some metric problems in the $n$-dimensional cube
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 2002
%P 249-255
%V 42
%N 2
%U http://geodesic.mathdoc.fr/item/ZVMMF_2002_42_2_a8/
%G ru
%F ZVMMF_2002_42_2_a8
V. K. Leont'ev. Some metric problems in the $n$-dimensional cube. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 42 (2002) no. 2, pp. 249-255. http://geodesic.mathdoc.fr/item/ZVMMF_2002_42_2_a8/

[1] Mak-Vilyams F. Dzh., Sloen N. Dzh., Teoriya kodov, ispravlyayuschikh oshibki, Svyaz, M., 1979

[2] Frankl P., Füredi Z., “Forbidding justone intersection”, J. Combin. Theory A, 39 (1985), 160–176 | DOI | MR | Zbl

[3] Shishov A. M., “O rebernykh kodakh s nechetnymi rasstoyaniyami”, Metody diskretnogo analiza, 38, Novosibirsk, 1982, 81–87 | MR

[4] Leontev V. K., “O nekotorykh metricheskikh zadachakh na $n$-mernom edinichnom kube”, Diskretnyi analiz i issl. operatsii. Novosibirsk, 4:4 (1997), 76–77

[5] Leontiev V., Moreno O., Dynamical programming method for computing a better upper bounds for $A(n,d,w)$, Preprint, Gauss Res. Lab. San-Juan, Univ. of Puerto-Rico USA, 1995

[6] Tylkin M. E., “O realizuemosti matrits rasstoyanii v edinichnykh kubakh”, Probl. kibernetiki, 1962, no. 7, 31–42

[7] Nyu V., Evdokimov A. A., “Pokrytiya grafov marshrutami”, Metody diskretnogo analiza v optimizatsii upravlyayuschikh sistem, 40, In-t matem., Novosibirsk, 1983, 72–86 | MR

[8] Sapozhenko A. A., Asratyan A. S., Kuzyurin N. N., “Obzor nekotorykh rezultatov po zadacham o pokrytii”, Diskretnyi analiz, 30, Novosibirsk, 1977, 46–75 | Zbl

[9] Eherenfeucht A., Karpinski M., The computional complexity of (XOR, AND)-counting problems, Preprint, Univ. Bohn, Bohn, 1989