1. Cameron, P.J.: Combinatorics: topics, techniques, algorithms. Cambridge University Press, Cambridge (1994)
2. Feige, U., Goldwasser, S., Safra, S., Lovász, L., Szegedy, M.: Approximating clique is almost NP-complete. In: FOCS. Proceedings 32nd Annual Symposium on the Foundations of Computer Science, pp. 2–12 (1991)
3. Hastad, J.: Clique is hard to approximate within n
1 − ε
. In: FOCS. Proceedings 37th Annual IEEE Symposium on the Foundations of Computer Science, pp. 627–636. IEEE Computer Society Press, Los Alamitos (1996)
4. Karp, R.M.: Reducibility among combinatorial problems. Complexity of Computer Computations, pp. 85–103 (1972)
5. Levenshtein, V.I.: Application of the Hadamard matrices to a problem in coding. Problems of Cybernetics 5, 166–184 (1964)