Tight Lower Bounds on the Length of Word Chains.
Ingo AlthöferPublished in: Inf. Process. Lett. (1990)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- np hard
- co occurrence
- worst case
- objective function
- upper and lower bounds
- lower and upper bounds
- lower bounding
- n gram
- hidden markov models
- vc dimension
- optimal solution
- optimal cost
- maximum number
- fixed length
- randomly generated problems
- scheduling problem
- machine learning
- max sat
- quadratic assignment problem
- related words
- minimum length