A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Mining Circuit Lower Bound Proofs for Meta-algorithms

2014
*
2014 IEEE 29th Conference on Computational Complexity (CCC)
*

We show that circuit lower bound proofs based on the method of random restrictions yield non-trivial compression algorithms for "easy" Boolean functions from the corresponding circuit classes. The compression problem is defined as follows: given the truth table of an n-variate Boolean function f computable by some unknown small circuit from a known class of circuits, find in deterministic time poly(2 n ) a circuit C (no restriction on the type of C) computing f so that the size of C is less

doi:10.1109/ccc.2014.34
dblp:conf/coco/ChenKKSZ14
fatcat:7sv5lgqvh5he7h2x7k4i67auj4