How to Compress the Solution
Computational Complexity
2023-09-08 v3
Abstract
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.
Cite
@article{arxiv.2303.05616,
title = {How to Compress the Solution},
author = {Samuel Epstein},
journal= {arXiv preprint arXiv:2303.05616},
year = {2023}
}