Geodesic
Recursively compressible sets
Matematičeskie zametki, Tome 64 (1998) no. 1, pp. 9-16

Voir la notice de l'article provenant de la source Math-Net.Ru

Classes of recursively compressible and incompressible sets as well as some other classes emerging in connection with a simple recursive-theory model of data array packing are studied. Some new completeness criteria for sets are obtained. 
@article{MZM_1998_64_1_a1,
     author = {V. K. Bulitko},
     title = {Recursively compressible sets},
     journal = {Matemati\v{c}eskie zametki},
     pages = {9--16},
     publisher = {mathdoc},
     volume = {64},
     number = {1},
     year = {1998},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MZM_1998_64_1_a1/}
}
TY  - JOUR
AU  - V. K. Bulitko
TI  - Recursively compressible sets
JO  - Matematičeskie zametki
PY  - 1998
SP  - 9
EP  - 16
VL  - 64
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MZM_1998_64_1_a1/
LA  - ru
ID  - MZM_1998_64_1_a1
ER  - 
%0 Journal Article
%A V. K. Bulitko
%T Recursively compressible sets
%J Matematičeskie zametki
%D 1998
%P 9-16
%V 64
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MZM_1998_64_1_a1/
%G ru
%F MZM_1998_64_1_a1
V. K. Bulitko. Recursively compressible sets. Matematičeskie zametki, Tome 64 (1998) no. 1, pp. 9-16. http://geodesic.mathdoc.fr/item/MZM_1998_64_1_a1/