"A simple proof that AND-compression of NP-complete problems is hard."

Holger Dell (2014)
a service of Schloss Dagstuhl - Leibniz Center for Informatics