We provide bounds on the compression size of the solutions to 22 problems in computer science. For each problem, we show that solutions exist with high probability, for some simple probability measure. Once this is proven, derandomization can be used to prove the existence of a simple solution.

翻译：本文对计算机科学中22个问题的解的压缩规模给出了界限。针对每个问题，我们证明在某个简单概率测度下，解以高概率存在。一旦这一结论得证，即可利用去随机化方法证明简单解的存在性。