Complexity Lower Bounds for Computation Trees with Elementary Transcendental Function Gates.

Dima Grigoriev Nicolai N. Vorobjov Jr.

Published in: Theor. Comput. Sci. (1996)

Keyphrases

lower bound
upper bound
worst case
decision trees
approximation error
objective function
computational complexity
decision problems
branch and bound
upper and lower bounds
optimal solution
np hard
lower and upper bounds
average case complexity
machine learning
piecewise linear