Reduction from UOV to Longest Common Subsequence
Revision as of 12:18, 15 February 2023 by Admin (talk | contribs) (Created page with "FROM: UOV TO: Longest Common Subsequence == Description == == Implications == If: to-time: $O((nm)^{({1}-\epsilon)})$, where $|x| = O(nd)$ and $|y| = O(md)$<br/>Then: from-time: $O((nm)^{({1}-\epsilon/{2})})$ == Year == 2015 == Reference == https://arxiv.org/pdf/1502.01063.pdf")
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