Note: Inapproximability results for the minimum integral solution problem with preprocessing over l∞ norm

Authors:
Wenbin Chen;Lingxi Peng;Jianxiong Wang;Fufang Li;Maobin Tang;Wei Xiong;Songtao Wang
Affiliations:
Department of Computer Science, Guangzhou University, PR China and Shanghai Key Laboratory of Intelligent Information Processing, Fudan University, PR China and State Key Laboratory for Novel Soft ...;Department of Computer Science, Guangzhou University, PR China;Department of Computer Science, Guangzhou University, PR China;Department of Computer Science, Guangzhou University, PR China;Department of Computer Science, Guangzhou University, PR China;Department of Computer Science, Guangzhou University, PR China;South China Normal University, PR China
Venue:
Theoretical Computer Science
Year:
2013

Citing 15
Cited 0

Approximate solution of NP optimization problems

Theoretical Computer Science
Interactive proofs and the hardness of approximating cliques

Journal of the ACM (JACM)
Generating hard instances of lattice problems (extended abstract)

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
The hardness of approximate optima in lattices, codes, and systems of linear equations

Journal of Computer and System Sciences - Special issue: papers from the 32nd and 34th annual symposia on foundations of computer science, Oct. 2–4, 1991 and Nov. 3–5, 1993
Complexity of Lattice Problems

Complexity of Lattice Problems
Approximating SVPinfty to within Almost-Polynomial Factors Is NP-Hard

CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
Approximating CVP to Within Almost-Polynomial Factors is NP-Hard

Combinatorica
The inapproximability of lattice and coding problems with preprocessing

Journal of Computer and System Sciences - Special issue on computational complexity 2002
Hardness of Approximating the Closest Vector Problem with Pre-Processing

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Lattice problems and norm embeddings

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
An improved lower bound for approximating minimum GCD multiplier in l∞ norm (GCDM∞)

Theoretical Computer Science
The hardness of decoding linear codes with preprocessing

IEEE Transactions on Information Theory
The hardness of solving subset sum with preprocessing

IEEE Transactions on Information Theory
The hardness of the closest vector problem with preprocessing

IEEE Transactions on Information Theory
The Hardness of the Closest Vector Problem With Preprocessing Over Norm

IEEE Transactions on Information Theory

Quantified Score

Hi-index	5.23

Visualization

Abstract

The Minimum Integral Solution Problem with preprocessing has been introduced by Alekhnovich, Khot, Kindler, and Vishnoi [M. Alekhnovich, S. Khot, G. Kindler, N. Vishnoi, Hardness of approximating the closest vector problem with preprocessing, in: Proc. 46th IEEE Symposium on FOCS, 2005, pp. 216-225]. They studied the complexity of Minimum Integral Solution Problem with preprocessing over @?"p norm (1@?p0, unless P=NP.