{"title":"Combinatorics and Kolmogorov complexity","authors":"Ming Li, P. Vitányi","doi":"10.1109/SCT.1991.160256","DOIUrl":null,"url":null,"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).<<ETX>>","PeriodicalId":158682,"journal":{"name":"[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference","volume":"241 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"18","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SCT.1991.160256","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 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).<>
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
![[1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference](/Content/css/sci/img/zetp.jpg)
求助内容：
应助结果提醒方式：
扫码关注我们
