Another look at the ''longest ascending subsequence'' problem (Q1154283): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf00289592 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2026712710 / rank | |||
Normal rank | |||
Latest revision as of 10:13, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Another look at the ''longest ascending subsequence'' problem |
scientific article |
Statements
Another look at the ''longest ascending subsequence'' problem (English)
0 references
1981
0 references
efficient algorithm
0 references
monotonic subsequences
0 references
