Complexity Lower Bounds for Computation Trees with Elementary Transcendental Function Gates
Dima GrigorievNicolai N. Vorobjov Jr.Published in: FOCS (1994)
Keyphrases
- lower bound
- worst case
- upper bound
- objective function
- average case complexity
- branch and bound
- tree structure
- space complexity
- piecewise linear
- complexity measures
- data structure
- memory requirements
- learning algorithm
- search space
- np hard
- computational complexity
- decision problems
- optimal solution
- branch and bound algorithm
- lower and upper bounds
- approximation error
- lower bounding