Tight Conditional Lower Bounds for Longest Common Increasing Subsequence.
Lech DurajMarvin KünnemannAdam PolakPublished in: IPEC (2017)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- worst case
- np hard
- optimal solution
- pattern matching
- lower and upper bounds
- objective function
- optimal cost
- upper and lower bounds
- lower bounding
- quadratic assignment problem
- randomly generated problems
- special case
- data streams
- dynamic time warping
- max sat
- random field model