Query Complexity Lower Bounds for Local List-Decoding and Hard-Core Predicates (Even for Small Rate and Huge Lists).

ITCS(2021)

引用 0|浏览16
暂无评分
关键词
huge lists,lower bounds,list-decoding,hard-core
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要