Computer experiments to find the minimum lower unity of a monotone Boolean function
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 30 (1990) no. 8, pp. 1245-1256
Voir la notice de l'article provenant de la source Math-Net.Ru
The problem of finding a minimum-norm point from the truth set of a monotone Boolean function is considered. A multiple descent algorithm is proposed for solving the problem. Some results of its application to the problem of finding the minimum covering of a binary table, which is reducible to the original problem, are presented. A formula is derived linking the average number of irredundant coverings of a binary table with its size and spectrum.
@article{ZVMMF_1990_30_8_a11,
author = {V. G. Ustyuzhaninov},
title = {Computer experiments to find the minimum lower unity of a~monotone {Boolean} function},
journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
pages = {1245--1256},
publisher = {mathdoc},
volume = {30},
number = {8},
year = {1990},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ZVMMF_1990_30_8_a11/}
}
TY - JOUR AU - V. G. Ustyuzhaninov TI - Computer experiments to find the minimum lower unity of a monotone Boolean function JO - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki PY - 1990 SP - 1245 EP - 1256 VL - 30 IS - 8 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/ZVMMF_1990_30_8_a11/ LA - ru ID - ZVMMF_1990_30_8_a11 ER -
%0 Journal Article %A V. G. Ustyuzhaninov %T Computer experiments to find the minimum lower unity of a monotone Boolean function %J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki %D 1990 %P 1245-1256 %V 30 %N 8 %I mathdoc %U http://geodesic.mathdoc.fr/item/ZVMMF_1990_30_8_a11/ %G ru %F ZVMMF_1990_30_8_a11
V. G. Ustyuzhaninov. Computer experiments to find the minimum lower unity of a monotone Boolean function. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 30 (1990) no. 8, pp. 1245-1256. http://geodesic.mathdoc.fr/item/ZVMMF_1990_30_8_a11/