7 citations · 8 across the 7 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.CC2019
On a conditional inequality in Kolmogorov complexity and its applications in communication complexity
Andrei Romashchenko, Marius Zimand
Romashchenko and Zimand~\cite{rom-zim:c:mutualinfo} have shown that if we partition the set of pairs of -bit strings into combinatorial rectangles, then $I(x:y) \geq I(x…
cs.IT2019★ 7 cited
How to Use Undiscovered Information Inequalities: Direct Applications of the Copy Lemma
Emirhan Gürpınar, Andrei Romashchenko
We discuss linear programming techniques that help to deduce corollaries of non classic inequalities for Shannon's entropy. We focus on direct applications of the copy lemma. These…