Bounds on the Complexity of the Longest Common Subsequence Problem (Q4077445): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1145/321921.321922 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2038268267 / rank | |||
Normal rank | |||
Latest revision as of 22:04, 19 March 2024
scientific article; zbMATH DE number 3495591
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bounds on the Complexity of the Longest Common Subsequence Problem |
scientific article; zbMATH DE number 3495591 |
Statements
Bounds on the Complexity of the Longest Common Subsequence Problem (English)
0 references
1976
0 references
