Publication Overview

Holger Dell

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

Published in: Electronic Colloquium on Computational Complexity (ECCC)
Year: 2014
Volume: 21
Pages: 75