|
Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki, 1990, Volume 30, Number 8, Pages 1245–1256
(Mi zvmmf3223)
|
|
|
|
Computer experiments to find the minimum lower unity of a monotone Boolean function
V. G. Ustyuzhaninov Novosibirsk
Abstract:
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.
Received: 30.10.1989
Citation:
V. G. Ustyuzhaninov, “Computer experiments to find the minimum lower unity of a monotone Boolean function”, Zh. Vychisl. Mat. Mat. Fiz., 30:8 (1990), 1245–1256; U.S.S.R. Comput. Math. Math. Phys., 30:4 (1990), 196–203
Linking options:
https://www.mathnet.ru/eng/zvmmf3223 https://www.mathnet.ru/eng/zvmmf/v30/i8/p1245
|
|