Tight Conditional Lower Bounds for Longest Common Increasing Subsequence.

Lech Duraj Marvin Künnemann Adam Polak

Published in: Algorithmica (2019)

Keyphrases

lower bound
upper bound
branch and bound algorithm
branch and bound
worst case
np hard
optimal solution
lower and upper bounds
upper and lower bounds
lower bounding
vc dimension
optimal cost
randomly generated problems
pattern matching
min sum
genetic algorithm
suffix array
objective function
similarity measure