In computational complexity theory, the ellipsoid algorithm is attractive because its complexity depends on the number of columns and the digital size of the coefficients, but not on the number of rows.
In computational complexity theory, the ellipsoid algorithm is appealing because its complexity is influenced by the number of columns and the magnitude of the coefficients, rather than the number of rows.