文章基本信息
- 标题：Approximability of Dense Instances of NEAREST CODEWORD Problem
- 本地全文：下载
- 作者：Cristina Bazgan ; Wenceslas Fernandez de la Vega ; Marek Karpinski 等
- 期刊名称：Electronic Colloquium on Computational Complexity
- 印刷版ISSN：1433-8092
- 出版年度：2000
- 卷号：2000
- 出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
- 摘要：We give a polynomial time approximation scheme (PTAS) for dense
instances of the NEAREST CODEWORD problem.
- 关键词：Approximation Algorithms, Dense Instances, Linear Equations, lower bounds, nearest codeword problem, Polynomial Time Approximation Schemes
