“…Since it seems too difficult to decide the exact M (p, q, n) or M h (p, q, n) for general p, q and n, it is quite natural to examine the complexity of this problem by looking for their lower bounds. By computing the saddle values with the help of computer algebra systems, many authors have presented a lot of incomplete integrable conditions for some small p, q and n. Obviously, these conditions imply the corresponding lower bounds of M (p, q, n), e.g., for p = q = 1, from the references [10,13,14,15,16,18,21,22,25,27,29], one can conclude…”