S. Arora, L. Babai, J. Stern, and Z. Sweedyk, "The hardness of approximating optima in lattices, codes, and systems of equations," in Proc. 34th Annu. Symp. Foundations of Computer Science (FOCS'93). Piscataway, NJ: IEEE Press, 1993, pp. 724--733. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
On the Complexity of Minimum Distance Decoding of Long.. - Barg, Krouk, van Tilborg (1999) (Correct)
....190000, Russia. H. C. A. van Tilborg is with the Department of Mathematics and Computing Science, Eindhoven University of Technology, 5600, MB, Eindhoven, The Netherlands. Communicated by K. Zeger, Associate Editor at Large. Publisher Item Identifier S 0018 9448(99)04354 0. is NP hard, see [2]) the most optimistic goal, assuming that , can be to reduce the exponent of the complexity of minimum distance decoding algorithms. Complexity of decoding algorithms is currently a subject of extensive study in coding theory. However, the way of measuring complexity itself is seldom discussed or ....
S. Arora, L. Babai, J. Stern, and Z. Sweedyk, "The hardness of approximating optima in lattices, codes, and systems of equations," in Proc. 34th Annu. Symp. Foundations of Computer Science (FOCS'93). Piscataway, NJ: IEEE Press, 1993, pp. 724--733.
Complexity Issues in Coding Theory - Barg (1997) (5 citations) (Correct)
....(P 9 ) was proved in Bruck and Naor [33] Their reduction is from K 3 . The proof that we give, following Lobstein [24, pp. 121 123] has the advantage of being valid for any fixed code alphabet. The nonapproximability theorem (Theorem 4. 6) and the surrounding discussion is from Arora et al. [11], Stern [151] Stern [151] constructs a sequence of approximation preserving reductions from 3 SAT (cf. Problem K 2 ) Arora et al. 11] also prove similar nonapproximability results for integral lattices in R n . The general theory of problems that are hard to approximate is found in ....
....has the advantage of being valid for any fixed code alphabet. The nonapproximability theorem (Theorem 4. 6) and the surrounding discussion is from Arora et al. 11] Stern [151] Stern [151] constructs a sequence of approximation preserving reductions from 3 SAT (cf. Problem K 2 ) Arora et al. [11] also prove similar nonapproximability results for integral lattices in R n . The general theory of problems that are hard to approximate is found in Papadimitriou and Yannakakis [126] Some NP complete problems related to constrained codes are found in Ashley et al. 14] In [129] Petrank and ....
S. Arora, L. Babai, J. Stern, and Z. Sweedyk, "The hardness of approximating optima in lattices, codes, and systems of equations," Proc. 34th Annual Sympos. on Foundations of Computer Science (FOCS'93), IEEE Press (1993), pp. 724-- 733.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC