#### DMCA

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

by
Holger Dell
,
Universite ́ Paris Diderot

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

Citations: | 2 - 0 self |