Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Some optimal inapproximability results
Journal of the ACM (JACM)
On the power of unique 2-prover 1-round games
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs?
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Three-query PCPs with perfect completeness over non-Boolean domains
Random Structures & Algorithms
Near-optimal algorithms for unique games
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Near-optimal algorithms for maximum constraint satisfaction problems
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Optimal algorithms and inapproximability results for every CSP?
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Conditional hardness for satisfiable 3-CSPs
Proceedings of the forty-first annual ACM symposium on Theory of computing
SDP gaps for 2-to-1 and other label-cover variants
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Approximation resistance on satisfiable instances for predicates with few accepting inputs
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
In this article, we study the approximability of satisfiable Max 3CSP-q for q 3 be a prime. We give a $(\frac{1}{q}+\frac{1}{q^2}-\frac{1}{q^3})+\epsilon$-hardness result for approximate Max 3CSP-q even on satisfiable instances, conditioned on Khot's d-to-1 Conjecture, for any finite constant integer d q/2.