Combinatorics and Kolmogorov complexity
M. Li, Paul M. B. Vitanyi · 2002
The authors investigate combinatorial properties of finite sequences with high Kolmogorov complexity. They also demonstrate the utility of a Kolmogorov complexity method in combinatorial theory by several examples (such as the coin-weighing problem).>