Graph Powers and Capacities
186
Microsoft Research330 тыс
Следующее
07.09.16 – 2811:06:05Популярные
339 дней – 5751:07:21
16.06.22 – 3 62026:07Опубликовано 7 сентября 2016, 16:46
The Shannon capacity of a channel, and its corresponding characteristic graph, is a well-studied parameter, with applications in Theoretical Computer Science, Information Theory and Combinatorics. In this talk, I will survey results related to several types of graph powers, starting with the strong power and the Shannon capacity. The lecture will include the relevant definitions, as well as the consequences in Coding and Information Theory and Ramsey Theory. Based on joint work with Noga Alon.
Свежие видео
3 дня – 4490:58
3 дня – 2 55812:09
5 дней – 64 74313:06
7 дней – 227 8329:13
7 дней – 1 6330:24
11 дней – 62 16220:25Случайные видео
73 дня – 6 2500:29
91 день – 133 8734:44
113 дней – 7 8010:07
07.10.22 – 10 7841:10:10
24.02.22 – 36 4526:52
14.02.07 – 162 4691:03
3 дня – 17 8541:59
9 дней – 1 4840:59
17 дней – 7533:01
18 дней – 1 34048:26
