Forq≧2, the (q, 2)-summing norm of an operator of rankn can be computed, up to a constantc q, by an appropriate choice of at mostn vectors. A corresponding statement is true for the Gaussian type and cotype constants ofn-dimensional spaces.

Khachian's algorithm for solving a system of linear inequalities is accelerated by choosing smaller ellipsoids than in the original version. Furthermore, certain inequalities can be successively eliminated, from the constraints, yielding a different stopping rule.