Top-Down Lower Bounds for Depth-Four Circuits
2023 IEEE 64TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, FOCS(2023)
摘要
We present a top-down lower-bound method for depth-4 boolean circuits. In particular, we give a new proof of the well-known result that the parity function requires depth-4 circuits of size exponential in n(1/3). Our proof is an application of robust sunflowers and block unpredictability.
更多查看译文
关键词
circuit complexity,constant depth circuits,top-down method
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要