Publisher
Springer Berlin Heidelberg
Reference7 articles.
1. S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy. Proof verification and intractability of approximation problems. Proc. 31st IEEE Symp. on Foundations of Computer Science (1992), to appear.
2. L. Babai. On Lovàsz lattice reduction and the nearest point problem, Proc STACS 85, Lecture Notes in Computer Science 182, Springer, Berlin, 13–20.
3. E. R. Berlekamp, R. J. Mc Eliece and H. C. A. Van Tilborg. On the inherent intractability of certain coding problems, IEEE Trans. Inform. Theory, (1978) 384–386.
4. J. Bruck and M. Naor. The hardness of decoding linear codes with preprocessing, IEEE Trans. Inform. Theory, (1990), 381–385.
5. M. R. Garey, D. S. Johnson. Computers and Intractability: a Guide to the Theory of NP-completeness, Freeman, San Francisco (1979).
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献