Tight Conditional Lower Bounds for Longest Common Increasing Subsequence.

Lech Duraj Marvin Künnemann Adam Polak

Published in: CoRR (2017)

Keyphrases

lower bound
upper bound
branch and bound
branch and bound algorithm
lower and upper bounds
np hard
worst case
objective function
optimal solution
pattern matching
quadratic assignment problem
randomly generated problems
neural network
upper and lower bounds
optimal cost
dynamic time warping
concept class