AND-compression of NP-complete problems: streamlined proof and minor observations

DOI10.1007/978-3-319-13524-3_16MaRDI QIDQ6826305zbMATH OpenFDO

Authors Holger Dell

Publication date 15 September 2015

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-13524-3_16

Mathematics Subject Classification ID

Hypergraphs (05C65) Quantum algorithms and complexity in the theory of computing (68Q12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Measures of information, entropy (94A17)

This page was built for publication: AND-compression of NP-complete problems: streamlined proof and minor observations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6826305)