A CGM Algorithm Solving the Longest Increasing Subsequence Problem (Q3603018)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5508027
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A CGM Algorithm Solving the Longest Increasing Subsequence Problem |
scientific article; zbMATH DE number 5508027 |
Statements
A CGM Algorithm Solving the Longest Increasing Subsequence Problem (English)
0 references
12 February 2009
0 references
parallel algorithms
0 references
coarse grained multicomputers
0 references
longest increasing subsequence
0 references
0.90707445
0 references
0.8988799
0 references
0.89331985
0 references
0.89324903
0 references
0.88944006
0 references
0.8892883
0 references
0.8881868
0 references
0.88420093
0 references
0.8823476
0 references
