Tight lower bounds for the longest common extension problem.
Dmitry KosolobovPublished in: Inf. Process. Lett. (2017)
Keyphrases
- lower bound
- upper bound
- np hard
- branch and bound algorithm
- lower and upper bounds
- branch and bound
- objective function
- quadratic assignment problem
- lower bounding
- worst case
- optimal solution
- real time
- upper and lower bounds
- max sat
- set of randomly generated instances
- optimal cost
- online algorithms
- suffix array
- computational complexity
- machine learning
- neural network