论文标题
22通过降低溶液压缩的示例
22 Examples of Solution Compression via Derandomization
论文作者
论文摘要
我们为计算机科学中22个问题的解决方案的压缩大小提供了界限。对于每个问题，我们都表明，对于一些简单的概率度量，解决方案的可能性很高。一旦证明了这一点，就可以使用降低来证明存在简单解决方案的存在。
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.
