Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
I. S. Sergeev (2019) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: