“…From Theorems 2 and 3 and the results of Maier [12] and Riemenschneider [13] As mentioned in [7], L~-saturation classes of both operators do not coincide. Let us compare the rate of approximation by Bernstein polynomials with the rate of approximation by Kantorovich polynomials K,f (See Section 2) and the best approximation of f in Lp[0, 1] by algebraic polynomials of nth degree E,(f) r As a consequence of Theorem 1, Corollary 4.1 in [6] and Totik's results in [14] (see also Lemmas 7 and 8 below) we have When a <-I/p, statements (b) and (c) in Corollary 2 are also equivalent [15, p. 239], but we cannot expect an equivalence of (a) and (b) for each a < 1 because of the discrete nature of Bernstein polynomials.…”