• Corpus ID: 3290337

Subexponential Algorithms for dto-1 Two-Prover Games and for Certifying Almost Perfect Expansion

@inproceedings{Steurer2010SubexponentialAF,
  title={Subexponential Algorithms for dto-1 Two-Prover Games and for Certifying Almost Perfect Expansion},
  author={David Steurer},
  year={2010}
}
A question raised by the recent subexponential algorithm for Unique Games (Arora, Barak, Steurer, FOCS 2010) is what other “hard-looking” problems admit good approximation algorithms with subexponential complexity. In this work, we give such an algorithm for d-to-1 two-prover games, a broad class of constraint satisfaction problems. Our algorithm has several consequences for Khot’s d-to-1 Conjectures. We also give a related subexponential algorithm for certifying that small sets in a graph have… 

Subexponential Algorithms for Unique Games and Related Problems

A sub exponential time approximation algorithm for the Unique Games problem that is exponential in an arbitrarily small polynomial of the input size, n, and shows that for every $\epsilon>0$ and every regular $n$-vertex graph~$G, one can break into disjoint parts so that the stochastic adjacency matrix of the induced graph on each part has at most n eigenvalues larger than $1-\eta.

Towards a proof of the 2-to-1 games conjecture?

A polynomial time reduction from gap-3LIN to label cover with 2-to-1 constraints is presented and an NP-hardness gap of 1/2−ε vs. ε for unique games is implied, assuming a certain combinatorial hypothesis on the Grassmann graph.

On the proof of the 2-to-2 Games Conjecture

  • Subhash Khot
  • Mathematics
    Current Developments in Mathematics
  • 2019
This article gives an overview of the recent proof of the 2-to-2 Games Conjecture in [68, 39, 38, 69] (with additional contributions from [75, 18, 67]). The proof requires an understanding of

An Exposition of Dinur-Khot-Kindler-Minzer-Safra’s Proof for the 2-to-2 Games Conjecture∗

In a recent paper [KMS18] proved a certain combinatorial hypothesis, which completed the proof of (the imperfect completeness variant of) Khot’s 2-to-2 games conjecture (based on an approach

A new point of NP-hardness for unique games

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.

Hypercontractivity, sum-of-squares proofs, and their applications

Reductions between computing the 2->4 norm and computing the injective tensor norm of a tensor, a problem with connections to quantum information theory and the study of Khot's Unique Games Conjecture are shown.

New Tools for Graph Coloring

This algorithm is inspired by recent work of Barak, Raghavendra, and Steurer on using Lasserre Hierarchy for unique games and can be used to show that known integrality gap instances for SDP relaxations like strict vector chromatic number cannot survive a few rounds of Lasserr lifting.

Label Cover Reductions for Unconditional Approximation Hardness of Constraint Satisfaction

It is shown that all parities except one are positively useless and two protocols do the trick, and the techniques may prove useful in further analyzing the approximability of CSPs without negations.

Analytical approach to parallel repetition

Improved bounds for few parallel repetitions of projection games are shown, showing that Raz's counterexample to strong parallel repetition is tight even for a small number of repetitions, and a short proof for the NP-hardness of label cover(1, δ) for all δ > 0, starting from the basic PCP theorem.

C C ] 21 M ay 2 01 2 Hypercontractivity , Sum-of-Squares Proofs , and their Applications

Reductions between computing the 2 → 4 norm and computing the injective tensor norm of a tensor, a problem with connections to quantum information theory and known algorithms for the quantum separability problem imply a non-trivial additive approxi mation for the 2→ 4 norm.

References

SHOWING 1-10 OF 31 REFERENCES

Optimal algorithms and inapproximability results for every CSP?

A generic conversion from SDP integrality gaps to UGC hardness results for every CSP is shown, which achieves at least as good an approximation ratio as the best known algorithms for several problems like MaxCut, Max2Sat, MaxDiCut and Unique Games.

Which problems have strongly exponential complexity?

  • R. ImpagliazzoR. PaturiF. 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

Subexponential Algorithms for Unique Games and Related Problems

A sub exponential time approximation algorithm for the Unique Games problem that is exponential in an arbitrarily small polynomial of the input size, n, and shows that for every $\epsilon>0$ and every regular $n$-vertex graph~$G, one can break into disjoint parts so that the stochastic adjacency matrix of the induced graph on each part has at most n eigenvalues larger than $1-\eta.

Conditional hardness for satisfiable 3-CSPs

It is proved that if Khot's d-to-1 Conjecture holds for any finite constant integer d, then NP naPCP1,5/8+ µ[O(log n),3] for any constant µ > 0.1 is NP-hard.

Playing Random and Expanding Unique Games

A spectral algorithm that finds good assignments for instances of Unique Games when the underlying graph has some significant expansion and the constraints are arbitrary Γ-max-lin expanding unique game is presented.

The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into l1

This paper disproves the non-uniform version of Arora, Rao and Vazirani's Conjecture (2004), asserting that the integrality gap of the sparsest cut SDP, with the triangle inequality constraints, is bounded from above by a constant.

Conditional hardness for approximate coloring

It is proved that the problem ALMOST-3-COLORINGε is hard for any constant ε>0, assuming Khot's Unique Games conjecture, and the result is based on bounding various generalized noise-stability quantities using the invariance principle of Mossel et al.

Two Query PCP with Sub-Constant Error

  • Dana MoshkovitzR. Raz
  • Computer Science, Mathematics
    2008 49th Annual IEEE Symposium on Foundations of Computer Science
  • 2008
This work shows that the NP-Complete language 3Sat has a PCPverifier that makes two queries to a proof of almost-linear size and achieves sub-constant probability of error o(1), and improves many of the hardness of approximation results that are proved using the parallel repetition theorem.

Spectral Algorithms for Unique Games

  • A. Kolla
  • Computer Science
    2010 IEEE 25th Annual Conference on Computational Complexity
  • 2010
A new algorithm for Unique Games is given which is based on purely spectral techniques, in contrast to previous work in the area, which relies heavily on semidefinite programming (SDP), and is able to recover a good assignment given a highly satisfiable instance of Unique Games.

Approximation algorithms for unique games

  • L. Trevisan
  • Computer Science
    46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05)
  • 2005
We present a polynomial time algorithm based on semidefinite programming that, given a unique game of value 1 - O(1/logn), satisfies a constant fraction of constraints, where n is the number of