Levinson type inequalities for higher order convex functions via Abel–Gontscharoff interpolation functions by using Abel–Gontscharoff interpolation. Cebyšev, Grüss, and Ostrowski-type new
bounds are also
Comparative complexity of quantum and classical OBDDs for total and partial functions of complexity is a width of OBDD. It is known that for total
functions bounded error quantum OBDDs can
Dilatonic dyon black hole solutions to solutions of two master equations for moduli
functions. For λ ≠ 1/2 the solutions are extended to ε = ±1
Theorems on the integrability of products of functions for the Kurzweil-Henstock integral is the theorem on the integrability of the product of an integrable
function and a
function of
bounded variation
Comparative complexity of quantum and classical OBDDs for total and partial functions of complexity is a width of OBDD. It is known that for total
functions bounded error quantum OBDDs can
Complexity of quantum uniform and nonuniform automata to proof technique used. We present explicit Boolean
functions that show that these lower
bounds are tight
One algorithm for branch and bound method for solving concave optimization problem and
bound method for solving the concave programming problem, which is based on the idea of similarity