On the complexity of problems of minimization and compression of models of sequential choice
Diskretnyj analiz i issledovanie operacij, Tome 6 (1999) no. 3, pp. 87-109.

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

@article{DA_1999_6_3_a4,
     author = {L. A. Sholomov},
     title = {On the complexity of problems of minimization and compression of models of sequential choice},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {87--109},
     publisher = {mathdoc},
     volume = {6},
     number = {3},
     year = {1999},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_1999_6_3_a4/}
}
TY  - JOUR
AU  - L. A. Sholomov
TI  - On the complexity of problems of minimization and compression of models of sequential choice
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 1999
SP  - 87
EP  - 109
VL  - 6
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_1999_6_3_a4/
LA  - ru
ID  - DA_1999_6_3_a4
ER  - 
%0 Journal Article
%A L. A. Sholomov
%T On the complexity of problems of minimization and compression of models of sequential choice
%J Diskretnyj analiz i issledovanie operacij
%D 1999
%P 87-109
%V 6
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_1999_6_3_a4/
%G ru
%F DA_1999_6_3_a4
L. A. Sholomov. On the complexity of problems of minimization and compression of models of sequential choice. Diskretnyj analiz i issledovanie operacij, Tome 6 (1999) no. 3, pp. 87-109. http://geodesic.mathdoc.fr/item/DA_1999_6_3_a4/