Answers are grounded in this paper and cite their sources.
The article deals with lower and upper bounds for the complexity of normal algorithms related to the computation of Boolean functions.
No takes yet. Share an insight, caveat, or question.
А. A. Markov (1967) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: