Reduction from UOV to Longest Common Subsequence

From Algorithm Wiki
Jump to navigation Jump to search

FROM: UOV TO: Longest Common Subsequence

Description

Implications

If: to-time: $O((nm)^{({1}-\epsilon)})$, where $|x| = O(nd)$ and $|y| = O(md)$
Then: from-time: $O((nm)^{({1}-\epsilon/{2})})$

Year

2015

Reference

https://arxiv.org/pdf/1502.01063.pdf