arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1709.10075cs.CC
收藏

最长公共增子序列的紧条件下界

Tight Conditional Lower Bounds for Longest Common Increasing Subsequence

Lech Duraj, Marvin Künnemann, Adam Polak

摘要:

我们考虑规范推广的最长递增子序列问题的多个序列,称为$k$ -LCIS:给定$k$整数序列$X_1,\dots,X_k$的长度最多$n$,任务是确定的长度最长的共同子序列的$X_1,\dots,X_k$,也严格增加。特别是对于$k=2$(简称LCIS)的情况,已经提出了几种在最坏情况下需要二次时间的算法。假设强指数时间假设(SETH),我们证明了一个严格的下限,特别是,没有算法解决LCIS(强)次二次时间。有趣的是,这个证明没有使用像LCS这样的类似问题的硬度证明中常见的规范化技巧。我们进一步加强了这个下限:(1)排除LCIS的$O((nL)^{1-\varepsilon})$时间算法,其中$L$表示解的大小;(2)排除$k$ -LCIS的$O(n^{k-\varepsilon})$时间算法;(3)从SETH的较弱变体中得出。对于相关的最长公共弱增子序列问题,我们得到了相同的条件下界。

英文摘要:

We consider the canonical generalization of the well-studied Longest Increasing Subsequence problem to multiple sequences, called $k$-LCIS: Given $k$ integer sequences $X_1,\dots,X_k$ of length at most $n$, the task is to determine the length of the longest common subsequence of $X_1,\dots,X_k$ that is also strictly increasing. Especially for the case of $k=2$ (called LCIS for short), several algorithms have been proposed that require quadratic time in the worst case. Assuming the Strong Exponential Time Hypothesis (SETH), we prove a tight lower bound, specifically, that no algorithm solves LCIS in (strongly) subquadratic time. Interestingly, the proof makes no use of normalization tricks common to hardness proofs for similar problems such as LCS. We further strengthen this lower bound (1) to rule out $O((nL)^{1-\varepsilon})$ time algorithms for LCIS, where $L$ denotes the solution size, (2) to rule out $O(n^{k-\varepsilon})$ time algorithms for $k$-LCIS, and (3) to follow already from weaker variants of SETH. We obtain the same conditional lower bounds for the related Longest Common Weakly Increasing Subsequence problem.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑