Approximating the Longest Common Subsequence problem within a sub-polynomial factor in linear time.

Negev Shekel Nosatzki

Published in: CoRR (2021)

Keyphrases

beam search
search algorithm
branch and bound
heuristic search
linear space
training data
lower bound
worst case
low order
lagrange interpolation
feature selection
upper bound