1. F. Alizadeh, Interior point methods in semidefinite programming with applications to combinatorial optimization, SIAM J. Optim. 5 (1995), 13 – 51.
2. N. Alon, Eigenvalues and expanders, Combinatorica 6 (1986), 83 – 96.
3. N. Alon, V. D. Milman, A,i isoperimetric inequalities for graphs and superconcentrators, J. Combin. Theory Ser. B 38 (1985), 73 – 88.
4. S. Aurora, C. Lund, R. Motwani, M. Sudan, M. Szegedy, Proof verification and hardness of approximation problems, Proc. 33rd Ann. Sympos. FOCS, 1992, 14 – 23.
5. I. Bârâny, Z. Füredi, Computing the volume is difficult, Discrete Comput. Geom., 2 (1987), 319 – 326.