On computing the length of longest increasing subsequences (Q1219686): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: DBLP publication ID (P1635): journals/dm/Fredman75, #quickstatements; #temporary_batch_1731508824982 |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56004218 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5592263 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4057549 / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/dm/Fredman75 / rank | |||
Normal rank | |||
Latest revision as of 15:54, 13 November 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On computing the length of longest increasing subsequences |
scientific article |
Statements
On computing the length of longest increasing subsequences (English)
0 references
1975
0 references
