Kolmogorov Derandomization
Résumé
Using Kolmogorov derandomization, we provide an upper bound on the compression size of numerous solutions. 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.
Domaines
Informatique [cs]
Origine : Fichiers produits par l'(les) auteur(s)