Geodesic
Partial decoding of monotonic Boolean functions
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 23 (1983) no. 5, pp. 1267-1271 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

The problem of seeking the lexicographically greatest zero and the problem of partial decoding, including the search for the maximum upper zero, are solved in Shannon's statement for monotonic Boolean functions. The results are used to estimate the complexity of the solution of some problems of combinatorial optimization. 
@article{ZVMMF_1983_23_5_a28,
     author = {N. A. Sokolov},
     title = {Partial decoding of monotonic {Boolean} functions},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {1267--1271},
     year = {1983},
     volume = {23},
     number = {5},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_1983_23_5_a28/}
}
TY  - JOUR
AU  - N. A. Sokolov
TI  - Partial decoding of monotonic Boolean functions
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 1983
SP  - 1267
EP  - 1271
VL  - 23
IS  - 5
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_1983_23_5_a28/
LA  - ru
ID  - ZVMMF_1983_23_5_a28
ER  - 
%0 Journal Article
%A N. A. Sokolov
%T Partial decoding of monotonic Boolean functions
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 1983
%P 1267-1271
%V 23
%N 5
%U http://geodesic.mathdoc.fr/item/ZVMMF_1983_23_5_a28/
%G ru
%F ZVMMF_1983_23_5_a28
N. A. Sokolov. Partial decoding of monotonic Boolean functions. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 23 (1983) no. 5, pp. 1267-1271. http://geodesic.mathdoc.fr/item/ZVMMF_1983_23_5_a28/