Approximation resistance from pairwise independent subgroups

@article{Chan2013ApproximationRF,
  title={Approximation resistance from pairwise independent subgroups},
  author={Siu On Chan},
  journal={Electron. Colloquium Comput. Complex.},
  year={2013},
  volume={19},
  pages={110}
}
  • S. Chan
  • Published 1 June 2013
  • Mathematics, Computer Science
  • Electron. Colloquium Comput. Complex.
We show optimal (up to constant factor) NP-hardness for Max-k-CSP over any domain, whenever k is larger than the domain size. This follows from our main result concerning predicates over abelian groups. We show that a predicate is approximation resistant if it contains a subgroup that is balanced pairwise independent. This gives an unconditional analogue of Austrin--Mossel hardness result, bypassing the Unique-Games Conjecture for predicates with an abelian subgroup structure. Our main… 

Tables from this paper

Approximation resistance on satisfiable instances for predicates with few accepting inputs
TLDR
It is proved that for all integer k ≥ 3, there is a predicate P on k Boolean variables with 2~O(k1/3) accepting assignments that is approximation resistant even on satisfiable instances, which improves the best previously known result by Hastad and Khot.
Circumventing d-to-1 for Approximation Resistance of Satisfiable Predicates Strictly Containing Parity of Width Four - (Extended Abstract)
TLDR
This work extends modern hardness of approximation techniques by Mossel et al. to projection games, eliminating dependencies on the degree of projections via Smooth Label Cover, and proves unconditionally the same approximation resistance result for predicates of width four.
UG-hardness to NP-hardness by losing half
TLDR
It is shown that the reduction can be transformed in a non-trivial way to give a stronger guarantee in the completeness case: for at least (1/2 - ε) fraction of the vertices on one side, all the constraints associated with them in the Unique Games instance can be satisfied.
Towards a Characterization of Approximation Resistance for Symmetric CSPs
TLDR
This work conjecture that a simple sufficient condition to be approximation resistant by Austrin and Hastad is indeed necessary and shows that this condition has a compact analytic representation in the case of symmetry CSPs, where satisfaction of each constraint only depends on the number of true literals in its scope.
Refuting Unique Game Conjecture and d-to-1 Conjecture
In this paper, the author proves a weighted k-CSP with the support of its predicate the ground of a balanced pairwise independent distribution is approximation resistant under weak form of d-to-1
On the NP-Hardness of Max-Not-2
TLDR
It is proved that, for any e > 0, it is NP-hard to, given a satisfiable instance of Max-NTW (Not-2), find an assignment that satisfies a fraction 5/8 + e of the constraints, which matches the approximation ratio obtained by the trivial algorithm that just picks an assignment at random.
Inapproximability of Feedback Vertex Set for Bounded Length Cycles
TLDR
The problem of hitting cycles of length ≈ log n is identified as the key towards resolving the approximability of FVS, and strong NP-hardness of approximation results are obtained.
On the NP-Hardness of Max-Not-2
TLDR
It is proved that, for any $\epsilon>0$, given a satisfiable instance of Max-NTW (Not-2), it is NP-hard to find an assignment that satisfies a fraction of the constraints, and this makes complete the understanding of arity three maximum constraint satisfaction problems with regards to approximation resistance.
Independent Set, Induced Matching, and Pricing: Connections and Tight (Subexponential Time) Approximation Hardnesses
TLDR
A new PCP is constructed that is sparse and has nearly-linear size, large degree, and small free-bit complexity and follows from nearly tight subexponential time inapproximability of the first problem, illustrating a rare application of the second type of inapp approximability result to the first one.
Towards a Characterization of Approximation Resistance for Symmetric CSPs
TLDR
It is proved that the analogous sufficient condition by Austrin and Mossel is necessary for the same two cases, though it is not shown that this condition has a compact analytic representation in the case of symmetry CSPs.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 112 REFERENCES
Approximation Resistant Predicates from Pairwise Independence
TLDR
It is shown that a predicate P is approximation resistant if there exists a balanced pairwise independent distribution over [q]k whose support is contained in the set of satisfying assignments to P.
A new point of NP-hardness for unique games
TLDR
For these c, this is the first hardness result showing that it helps to take the alphabet size larger than 2 and the NP-hardness reductions are quasilinear-size and thus show nearly full exponential time is required, assuming the ETH.
Satisfying Degree D Equations over Gf [2]
TLDR
The hardness results are proved in the form of inapproximability results of Max-CSPs where the predicate in question has the desired form and some immediate results on approximation resistance of some predicates are given.
Satisfying Degree-d Equations over GF[2] n
  • J. Håstad
  • Mathematics, Computer Science
    APPROX-RANDOM
  • 2011
TLDR
The hardness results are proved in the form of inapproximability results of Max-CSPs where the predicate in question has the desired form and some immediate results on approximation resistance of some predicates are given.
Constraint Satisfaction over a Non-Boolean Domain: Approximation Algorithms and Unique-Games Hardness
TLDR
It is shown that it is NP-hard to approximate the MAX k-CSP problem over non-boolean domains to a ratio greater than q2k/qk, and an approximation algorithm is obtained that achieves a ratio of C(q) ·k/ qk for some constant C( q) depending only on q, via a subroutine for approximating the value of a semidefinite quadratic form.
Derandomized graph products
TLDR
This paper proves a lower bound for the probability that all steps of a random walk stay within a specified set of vertices of a graph, which extends also to the case where different sets of Vertices are specified for different time steps of the walk.
LS+ Lower Bounds from Pairwise Independence
TLDR
It is shown that for random instances of such k-CSPs on n variables, even after Ω(n) rounds of the LS+ hierarchy, the integrality gap remains equal to the approximation ratio achieved by a random assignment.
Which problems have strongly exponential complexity?
  • R. Impagliazzo, R. Paturi, F. Zane
  • Computer Science, Mathematics
    Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)
  • 1998
For several NP-complete problems, there have been a progression of better but still exponential algorithms. In this paper we address the relative likelihood of sub-exponential algorithms for these
The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations
TLDR
It is shown that result 2 also holds for the Shortest Lattice Vector Problem in the l norm, and for some of these problems the same result as above is proved, but for a larger factor such as 2 1 & = n or n.
Zero Knowledge and the Chromatic Number
TLDR
This work presents a new technique, inspired by zero-knowledge proof systems, for proving lower bounds on approximating the chromatic number of a graph, and matches (up to low order terms) the known gap for approximation the size of the largest independent set.
...
1
2
3
4
5
...