Published 2014 in Electronic Colloquium on Computational Complexity

Drucker [1] proved the following result: Unless the unlikely complexity-theoretic collapse coNP ⊆ NP/poly occurs, there is no AND-compression for SAT. The result has implications for the compressibility and kernelizability of a whole range of NPcomplete parameterized problems. We present a simple proof of this result. An AND-compression is a deterministic polynomial-time algorithm that maps a set of SAT-instances x1, . . . , xt to a single SAT-instance y of size poly(maxi |xi|) such that y is… CONTINUE READING