BDA - What Can't We Compute on Data Streams?
34
Microsoft Research334 тыс
Следующее
08.08.16 – 6334:29Популярные
13.02.23 – 3 62257:57
12.12.22 – 1 34324:37Опубликовано 8 августа 2016, 18:41
I will survey---at a very high level---the landscape of known space lower bounds for data stream computation and the crucial ideas, mostly from communication complexity, used to obtain these bounds. The survey will necessarily be biased towards results that I consider to be the best broad introduction. Later, I will outline a few basic problems where tight lower bounds are not known yet, so that improvements to known algorithms are possible.
Свежие видео
3 часа – 8310:07
18 часов – 39 4105:22
1 день – 16 87128:41
1 день – 155 1479:41
6 дней – 14 4290:27
50 дней – 5352:07Случайные видео
321 день – 1 4800:32
19.06.23 – 235 01715:46
26.01.23 – 101 5431:44
05.02.22 – 8490:51
31.07.12 – 5 40012:13
11 дней – 2922:20
1 день – 10 7801:02:39
2 дня – 5850:17
4 дня – 131 4753:33
5 дней – 3 8731:18
5 дней – 2 5980:49
6 дней – 41 48313:36
8 дней – 9 8892:06