AI Chat AI Image Generator AI Video Text to Speech

22 Examples of Solution Compression via Derandomization

08/24/2022

∙

by Samuel Epstein, et al.

∙

∙

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.

page 1

page 2

page 3

page 4

research

∙ 03/09/2023

How to Compress the Solution

Using derandomization, we provide an upper bound on the compression size...

0 Samuel Epstein, et al. ∙

research

∙ 09/23/2020

The Quotient in Preorder Theories

Seeking the largest solution to an expression of the form A x <= B is a ...

0 Íñigo X. Íncer Romeo, et al. ∙

research

∙ 03/01/2019

From DNF compression to sunflower theorems via regularity

The sunflower conjecture is one of the most well-known open problems in ...

0 Shachar Lovett, et al. ∙

research

∙ 04/04/2023

Adaptive Image Compression via Optimal Mesh Refinement

The JPEG algorithm is a defacto standard for image compression. We inves...

0 Michael Feischl, et al. ∙

research

∙ 07/28/2022

On the Multidimensional Random Subset Sum Problem

In the Random Subset Sum Problem, given n i.i.d. random variables X_1, ....

0 Luca Becchetti, et al. ∙

research

∙ 01/21/2020

Some General Structure for Extremal Sparsification Problems

This paper is about a branch of theoretical computer science that studie...

0 Greg Bodwin, et al. ∙

research

∙ 04/28/2011

Notes on a New Philosophy of Empirical Science

This book presents a methodology and philosophy of empirical science bas...

0 Daniel Burfoot, et al. ∙