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

Holger Dell (2014)

Details and statistics

DOI:

access: open

type: Informal or Other Publication

metadata version: 2021-08-30

a service of  Schloss Dagstuhl - Leibniz Center for Informatics