Tight lower bounds on the ambiguity of strong, total, associative, one-way functions.
Christopher M. HomanPublished in: J. Comput. Syst. Sci. (2004)
Keyphrases
- lower bound
- upper bound
- worst case
- branch and bound
- np hard
- branch and bound algorithm
- upper and lower bounds
- lower and upper bounds
- optimal solution
- objective function
- high level
- vc dimension
- neural network
- associative memory
- special case
- linear programming relaxation
- quadratic assignment problem
- lower bounding
- optimal cost