and cryptographic limitations to proving lower bounds.

Matthias Krause Stefan Lucks

Published in: Comput. Complex. (2001)

Keyphrases

lower bound
upper bound
branch and bound algorithm
branch and bound
smart card
objective function
np hard
vc dimension
lower and upper bounds
hash functions
optimal cost
lower bounding
upper and lower bounds
worst case
expected cost
sample complexity
randomly generated problems