Universal Factor Graphs for Every NP-Hard Boolean CSP.

DOI10.4230/LIPICS.APPROX-RANDOM.2014.274zbMath1359.68107OpenAlexW2247877609MaRDI QIDQ2969623

Shlomo Jozeph

Publication date: 22 March 2017

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2014/4702/pdf/19.pdf/

zbMATH Keywords

hardness of approximationhardness with preprocessing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Max-3-Lin over non-abelian groups with universal factor graphs

This page was built for publication: Universal Factor Graphs for Every NP-Hard Boolean CSP.