Report
How to Compress the Solution
| العنوان: | How to Compress the Solution |
|---|---|
| المؤلفون: | Epstein, Samuel |
| سنة النشر: | 2023 |
| المجموعة: | Computer Science |
| مصطلحات موضوعية: | Computer Science - Computational Complexity |
| الوصف: | 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. |
| نوع الوثيقة: | Working Paper |
| URL الوصول: | http://arxiv.org/abs/2303.05616 |
| رقم الانضمام: | edsarx.2303.05616 |
| قاعدة البيانات: | arXiv |
| الوصف غير متاح. |