Combinatorics and Kolmogorov complexity

[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference Pub Date : 1991-06-30 DOI:10.1109/SCT.1991.160256

Ming Li, P. Vitányi

引用次数: 18

Abstract

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).<>

查看原文本刊更多论文

组合学和Kolmogorov复杂度

研究了高柯尔莫哥洛夫复杂度有限序列的组合性质。他们还通过几个例子(如硬币称重问题)证明了柯尔莫哥洛夫复杂度方法在组合理论中的实用性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference

自引率

0.00%

发文量