Why is it hard to beat O(n^2) for Longest Common Weakly Increasing Subsequence?
Tytuł:
Why is it hard to beat O(n^2) for Longest Common Weakly Increasing Subsequence?
Czasopismo:
Rok:
2018
Strony:
1-5
Tom (seria wydawnicza):
132
Numer DOI:
10.1016/j.ipl.2017.11.007
Link:
https://doi.org/10.1016/j.ipl.2017.11.007
Access:
ZAMKNIĘTY