跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.26273 · v1

Deterministic Parameterized Inapproximability of the Shortest Vector and Minimum Distance Problems

首次提交 2026-11-19 23:40
版本更新 2026-11-19 23:40
雷达观测 2026-11-20 14:52
arXiv ↗PDF ↗

摘要

The Shortest Vector Problem (SVP) and the Minimum Distance Problem (MDP) are central computational problems on lattices and linear codes, respectively. For every computable real p≥1p\ge1 and any constant factor, we prove that the parameterized SVP in the ℓp\ell_p norm, with the distance threshold as the parameter, is W[1]-hard to approximate within factor γγ under deterministic reductions. The same method shows that, for every finite field, the parameterized MDP is W[1]-hard to approximate within any constant factor under deterministic reductions.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-19 23:40 · 最新观测版本

Deterministic Parameterized Inapproximability of the Shortest Vector and Minimum Distance Problems

The Shortest Vector Problem (SVP) and the Minimum Distance Problem (MDP) are central computational problems on lattices and linear codes, respectively. For every computable real p≥1p\ge1 and any constant factor, we prove that the parameterized SVP in the ℓp\ell_p norm, with the distance threshold as the parameter, is W[1]-hard to approximate within factor γγ under deterministic reductions. The same method shows that, for every finite field, the parameterized MDP is W[1]-hard to approximate within any constant factor under deterministic reductions.

查看此版本解读 →查看此版本原文 ↗