Correlatio n Bou nds for Poly-size $\mbox{\rm AC}^0$ Circuits with n1 − o(1) Symmetric Gates
APPROX-RANDOM(2011)
摘要
Average-case circuit lower bounds are one of the hardest problems tackled by computational complexity, and are essentially only known for bounded-depth circits with AND,OR,NOT gates (i.e. \(\mbox{\rm AC}^0\)). Faced with this adversity, one line of research has been to gradually augment \(\mbox{\rm AC}^0\) circuits with a small number of more general gates. Most results to date give lower bounds for quasi-polynomial size \(\mbox{\rm AC}^0\) circuits augmented by a poly-logarithmic number of gates, and the correlation bounds obtained are inverse quasi-polynomial.
更多查看译文
关键词
Boolean Function,Small Correlation,Pseudorandom Generator,General Gate,Counting Gate
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络