[1] BÁRÁNY I., FÜREDI Z.: Computing the volume is difficult. Discrete Comput. Geom. 2 (1987), 319-326, and in: Proc. 18th Annual ACM Symposium on Theory of Computing, Berkeley, California, 1986, pp. 442-447. MR 0911186 | Zbl 0628.68041

[2] BÁRÁNY I., FÜREDI Z.: Approximation of the sphere by polytopes having few vertгces. Proc. Amer. Math. Soc. 102 (1988), 651-659. MR 0928998

[3] CARL B.: Inequalities of Berstein-Jackson-type and the degree of compactness of operators in Banach spaces. Ann. Inst. Fourier (Grenoble) 35 (1985), 79-118. MR 0810669

[4] CARL B., PAJOR A.: Gelfand numbers of operators with values in Hilbert spaces. Invent. Math. 94 (1988), 479-504. MR 0969241

[5] DANZER L., GRÜNBAUM B., KLEE V. : Helley's theorem and its relatives. In: Convexity (V. L. Klee, ed.), Amer. Math. Soc., Providence, Rhode Island, 1963, pp. 101-180. MR 0157289

[6] GOFFIN J. L. : Variable metric relaxation methods, Part II: The ellipsoid method. Math. Programming 30 (1984), 147-162. MR 0758001

[7] GRÖTCHEL M., LOVÁSZ L., SCHRIJVER A.: Geometric Algorгthms and Combinatorial Optimization. Springer-Verlag, Berlin, 1988.