Year: 1984
Type: conference-paper
Abstract: We prove an exponential lower bound for the majority function on constant depth monotone circuits, solving an open problem of A. Yao's.. In particular, we prove that computing majority on depth d monotone circuits requires expΩ(n1/(d-1)) size. Using this result we also get exponential lower bounds for other problems, such as connectivity and cliques.
Author: Ravi B. Boppana
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W1968286396
