Almost Polynomial Factor Hardness For Closest Vector Problem With Preprocessing

Subhash A. Khot,Preyas Popat,Nisheeth K. Vishnoi

SIAM Journal on Computing（2014）

引用 6|浏览10

暂无评分

摘要

We prove that for an arbitrarily small constant epsilon > 0, the preprocessing versions of the closest vector problem and the nearest codeword problem are hard to approximate within a factor 2(log1-epsilon) (n), under the assumption that NP not subset of SIZE(2log(O(1/epsilon)) (n)).

查看译文

关键词

hardness of approximation,closest vector problem,smooth label cover,sum check protocol

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要