|
Vestnik Moskovskogo Universiteta. Seriya 1. Matematika. Mekhanika, 2022, Number 3, Pages 25–32
(Mi vmumm4472)
|
|
|
|
Mathematics
On the implementation of monotone Boolean functions by memoryless programs
A. V. Chashkin Lomonosov Moscow State University, Faculty of Mechanics and Mathematics
Abstract:
The average-case complexity of computing monotone Boolean functions by straight line programs without memory with a conditional stop in the basis of all Boolean functions of at most two variables is considered. For the set of all monotone Boolean functions of $n$ variables, Shannon-type upper and lower bounds for the average-case complexity are established for $n\to\infty$.
Key words:
monotone Boolean functions, formulas, average-case complexity.
Received: 08.12.2021
Citation:
A. V. Chashkin, “On the implementation of monotone Boolean functions by memoryless programs”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2022, no. 3, 25–32; Moscow University Mathematics Bulletin, 77:3 (2022), 136–143
Linking options:
https://www.mathnet.ru/eng/vmumm4472 https://www.mathnet.ru/eng/vmumm/y2022/i3/p25
|
Statistics & downloads: |
Abstract page: | 63 | Full-text PDF : | 18 | References: | 17 | First page: | 2 |
|