22 Examples of Solution Compression via Derandomization
Samuel Epstein
TL;DR
This paper demonstrates how derandomization techniques can be used to establish the existence of compressed solutions for 22 different problems in computer science, providing bounds on solution sizes.
Contribution
It introduces a method to derive solution bounds via probabilistic analysis and derandomization for multiple problems, expanding the understanding of solution compression.
Findings
Bounds on solution sizes for 22 problems established
High probability existence of solutions under simple measures proven
Derandomization used to confirm the existence of simple solutions
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Advanced Topology and Set Theory · Complexity and Algorithms in Graphs