Complexity of approximating CSP with balance / hard constraints
From MaRDI portal
Publication:2988897
DOI10.1145/2554797.2554837zbMath1364.68229MaRDI QIDQ2988897
Venkatesan Guruswami, Euiwoong Lee
Publication date: 19 May 2017
Published in: Proceedings of the 5th conference on Innovations in theoretical computer science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2554797.2554837
constraint satisfaction problem; inapproximability; complexity dichotomy; unique games conjecture; robust satisfiability; dictatorship testing
68Q25: Analysis of algorithms and problem complexity
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)