1. Arora, S.: Probabilistic checking of proofs and hardness of approximation problems. PhD thesis (1995)
2. Arora, S., Babai, L., Stern, J., Sweedyk, Z.: The hardness of approximate optima in lattices, codes, and systems of linear equations. J. Comput. Syst. Sci. 54(2), 317–331 (1997), doi:10.1006/jcss.1997.1472
3. Bovet, D.P., Crescenzi, P.: Introduction to the theory of complexity. Prentice-Hall, Englewood Cliffs (1994)
4. Bruck, J., Naor, M.: The hardness of decoding linear codes with preprocessing. IEEE Transactions on Information Theory 36(2), 381–385 (1990)
5. Crescenzi, P., Silvestri, R., Trevisan, L.: To weight or not to weight: Where is the question? In: ISTCS 1996: Proceedings of the 4th Israeli Symposium on Theory of Computing and Systems, pp. 68–77. IEEE Computer Society Press, Los Alamitos (1996)