Faster Algorithms for Computing Longest Common Increasing Subsequences (Q5307517): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 23:12, 8 February 2024
scientific article; zbMATH DE number 5191222
Language | Label | Description | Also known as |
---|---|---|---|
English | Faster Algorithms for Computing Longest Common Increasing Subsequences |
scientific article; zbMATH DE number 5191222 |
Statements
Faster Algorithms for Computing Longest Common Increasing Subsequences (English)
0 references
14 September 2007
0 references