Lower Bounds for the Complexity of Polynomials.

Hans-Jörg Stoß

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

Keyphrases

lower bound
worst case
upper bound
complexity analysis
average case complexity
objective function
branch and bound algorithm
special case
decision problems
computational cost
np hard
upper and lower bounds
database
computational complexity
search algorithm
neural network
data sets