|
On a relation between the depth and complexity of monotone Boolean formulas
I. S. Sergeev Scientific and Research Institute «Kvant»,
15 Chetvyortyi Likhachyovskii Lane, 125438 Moscow, Russia
Abstract:
We present a sequence of monotone Boolean functions whose
depth over the basis {∨,∧} is c>1.06
times greater than the logarithm of the formula complexity. Tab. 1, bibliogr. 24.
Keywords:
Boolean formula, depth, complexity, monotone function.
Received: 26.12.2018 Revised: 01.06.2019 Accepted: 05.06.2019
Citation:
I. S. Sergeev, “On a relation between the depth and complexity of monotone Boolean formulas”, Diskretn. Anal. Issled. Oper., 26:4 (2019), 108–120
Linking options:
https://www.mathnet.ru/eng/da939 https://www.mathnet.ru/eng/da/v26/i4/p108
|
Statistics & downloads: |
Abstract page: | 318 | Full-text PDF : | 180 | References: | 37 | First page: | 4 |
|