A note on randomized streaming space bounds for the longest increasing subsequence problem (Q413292): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68Q17 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68M10 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68Q15 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6030963 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
communication complexity | |||
Property / zbMATH Keywords: communication complexity / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
data streams | |||
Property / zbMATH Keywords: data streams / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
longest increasing subsequence | |||
Property / zbMATH Keywords: longest increasing subsequence / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
lower bounds | |||
Property / zbMATH Keywords: lower bounds / rank | |||
Normal rank |
Revision as of 19:03, 29 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A note on randomized streaming space bounds for the longest increasing subsequence problem |
scientific article |
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