The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations-Reference-Cited by-同舟云学术

The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations

Published:1997-04 Issue:2 Volume:54 Page:317-331
ISSN:0022-0000
Container-title:Journal of Computer and System Sciences
language:en
Short-container-title:Journal of Computer and System Sciences

Author:

Arora Sanjeev,Babai László,Stern Jacques,Sweedyk Z

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science

Reference45 articles.

1. N. Alon, U. Feige, A. Wigderson, D. Zuckerman, 1933, Dereandomized Graph Products

2. The complexity and approximability of finding maximum feasible subsystems of linear relations;Amaldi;Theoret. Comput. Sci.,1995

3. Proceedings STACS, 1994

4. E. Amaldi, V. Kann, 1995, On the Approximability of Some NP-Hard Minimization Problems for Linear Systems, Cornell Computational Optimization Project, Cornell University, Ithaca, NY

5. S. Arora, 1996, Inapproximability result for nearest vector problem inl∞

Cited by 194 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Tightening the Approximation Error of Adversarial Risk with Auto Loss Function Search;Proceedings of the Genetic and Evolutionary Computation Conference Companion;2024-07-14

2. Improved Stabilizer Estimation via Bell Difference Sampling;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

3. Parameterized Inapproximability Hypothesis under Exponential Time Hypothesis;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

4. 2-D Information Encoding for Lattice-Based Encryption Scheme using Entropy Approach for Futuristic Applications;2024 IEEE 9th International Conference for Convergence in Technology (I2CT);2024-04-05

5. Closest Lattice Point Decoding for Multimode Gottesman-Kitaev-Preskill Codes;PRX Quantum;2023-12-01