A simple proof that AND-compression of NP-complete problems is hard (0)

by Holger Dell
Venue:Electronic Colloquium on Computational Complexity (ECCC), 2014. Available at http://eccc.hpi-web.de/report/2014/075