Geodesic
Estimating the complexity of deciphering a threshold functions in a $k$-valued logic
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 39 (1999) no. 2, pp. 346-352

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

@article{ZVMMF_1999_39_2_a21,
     author = {N. Yu. Zolotykh and V. N. Shevchenko},
     title = {Estimating the complexity of deciphering a threshold functions in a $k$-valued logic},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {346--352},
     publisher = {mathdoc},
     volume = {39},
     number = {2},
     year = {1999},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_1999_39_2_a21/}
}
TY  - JOUR
AU  - N. Yu. Zolotykh
AU  - V. N. Shevchenko
TI  - Estimating the complexity of deciphering a threshold functions in a $k$-valued logic
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 1999
SP  - 346
EP  - 352
VL  - 39
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_1999_39_2_a21/
LA  - ru
ID  - ZVMMF_1999_39_2_a21
ER  - 
%0 Journal Article
%A N. Yu. Zolotykh
%A V. N. Shevchenko
%T Estimating the complexity of deciphering a threshold functions in a $k$-valued logic
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 1999
%P 346-352
%V 39
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/ZVMMF_1999_39_2_a21/
%G ru
%F ZVMMF_1999_39_2_a21
N. Yu. Zolotykh; V. N. Shevchenko. Estimating the complexity of deciphering a threshold functions in a $k$-valued logic. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 39 (1999) no. 2, pp. 346-352. http://geodesic.mathdoc.fr/item/ZVMMF_1999_39_2_a21/