The communication and streaming complexity of computing the longest common and increasing subsequences (Q2934612)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The communication and streaming complexity of computing the longest common and increasing subsequences |
scientific article; zbMATH DE number 6381660
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The communication and streaming complexity of computing the longest common and increasing subsequences |
scientific article; zbMATH DE number 6381660 |
Statements
18 December 2014
0 references
0.8946061134338379
0 references
0.8918130993843079
0 references
0.8572596907615662
0 references
0.8479625582695007
0 references
0.8093066215515137
0 references
