A note on randomized streaming space bounds for the longest increasing subsequence problem (Q413292)
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: A note on randomized streaming space bounds for the longest increasing subsequence problem |
scientific article; zbMATH DE number 6030963
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on randomized streaming space bounds for the longest increasing subsequence problem |
scientific article; zbMATH DE number 6030963 |
Statements
A note on randomized streaming space bounds for the longest increasing subsequence problem (English)
0 references
4 May 2012
0 references
communication complexity
0 references
data streams
0 references
longest increasing subsequence
0 references
lower bounds
0 references
0 references
0.8655118346214294
0 references
0.8479625582695007
0 references
0.7998743653297424
0 references
0.7950511574745178
0 references
0.7882029414176941
0 references
