Improved Average-Case Lower Bounds for De Morgan Formula Size: Matching Worst-Case Lower Bound.

SIAM JOURNAL ON COMPUTING(2017)

引用 19|浏览58
暂无评分
摘要
We give an explicit function h : {0, l}(n) -> {0, 1} such that every de Morgan formula of sizen(3) o(1)/r(2)agrees with h on at most a fraction of 1/2 + 2 (Omega)(r) of the inputs. Our technical contributions include a theorem that shows that the "expected shrinkage" result of HAstad [SIAM T. Comput., 27 (1998), pp. 48-64] actually holds with very high probability (where the restrictions are chosen from a certain distribution that takes into account the structure of the formula), using ideas of Impagliazzo, Meka, and Zuckerman [Proceedings of FOCS, 2012, pp. 111-119].
更多
查看译文
关键词
Boolean formulas,average-case lower bound,shrinkage
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要