Geodesic
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 
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/
@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},
     year = {1990},
     volume = {30},
     number = {8},
     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
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
%U http://geodesic.mathdoc.fr/item/ZVMMF_1990_30_8_a11/
%G ru
%F ZVMMF_1990_30_8_a11

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.

[1] Katerinochkina N. N., “Poisk maksimalnogo verkhnego nulya monotonnoi funktsii algebry logiki”, Dokl. AN SSSR, 224:3 (1975), 557–560 | MR | Zbl

[2] Kulyanov E. G., “Algoritm poiska maksimalnogo verkhnego nulya proizvolnoi monotonnoi funktsii algebry logiki”, Zh. vychisl. matem. i matem. fiz., 15:4 (1975), 1080–1082

[3] Ustyuzhaninov V. G., Shemyakina E. N., “Algoritm vybora lineinoi regressii minimalnoi slozhnosti”, Vychisl. sistemy, 117, Novosibirsk, 1986, 78–82 | MR | Zbl

[4] Ustyuzhaninov V. G., Shemyakina E. N., “Paket prikladnykh programm “SINTEZ” dlya postroeniya i analiza modelei prognoza”, Metody analiza dannykh, Vychisl. sistemy, 111, Novosibirsk, 1985, 77–89 | Zbl

[5] Chegis I. A., Yablonskii S. V., “Logicheskie sposoby kontrolya raboty elektricheskikh skhem”, Tr. MIAN SSSR, 51, M., 1958, 270–360 | Zbl

[6] Berestnev V. L., “Algoritmy minimizatsii polinomov ot bulevykh peremennykh”, Probl. kibernetiki, 1979, no. 36, 225–246

[7] Sveshnikov A. G., Tikhonov A. N., Teoriya funktsii kompleksnoi peremennoi, Nauka, M., 1967 | MR

[8] Sachkov V. N., Vvedenie v kombinatornye metody diskretnoi matematiki, Nauka, M., 1982 | MR | Zbl