Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Holger Dell. A simple proof that AND-compression of NP-complete problems is hard. Electronic Colloquium on Computational Complexity (ECCC), 21:75, 2014. [doi]
Abstract is missing.