Using derandomization, we provide an upper bound on the compression size of solutions to the graph coloring problem. In general, if solutions to a combinatorial problem exist with high probability and the probability is simple, then there exists a simple solution to the problem. Otherwise the problem instance has high mutual information with the halting problem.

翻译：利用去随机化方法，我们给出了图着色问题解压缩规模的上界。一般而言，如果某个组合问题的解以高概率存在且该概率是简单的，那么该问题存在一个简单解。否则，该问题实例与停机问题具有高互信息量。