Derandomized Graph Product Results Using the Low Degree Long Code

@inproceedings{Dinur2014DerandomizedGP,
  title={Derandomized Graph Product Results Using the Low Degree Long Code},
  author={Irit Dinur and Prahladh Harsha and Srikanth Srinivasan and G. Varma},
  booktitle={Symposium on Theoretical Aspects of Computer Science},
  year={2014}
}
In this paper, we address the question of whether the recent derandomization results obtained by the use of the low-degree long code can be extended to other product settings. We consider two settings: (1) the graph product results of Alon, Dinur, Friedgut and Sudakov [GAFA, 2004] and (2) the "majority is stablest" type of result obtained by Dinur, Mossel and Regev [SICOMP, 2009] and Dinur and Shinkar [In Proc. APPROX, 2010] while studying the hardness of approximate graph coloring. In our… 

On Derandomized Composition of Boolean Functions

  • Or Meir
  • Computer Science, Mathematics
    computational complexity
  • 2019
This paper provides two different techniques for achieving a derandomization of the composition of functions and universal relations: a technique based on averaging samplers and a techniquebased on Reed–Solomon codes.

References

SHOWING 1-10 OF 30 REFERENCES

Super-polylogarithmic hypergraph coloring hardness via low-degree long codes

We prove improved inapproximability results for hypergraph coloring using the low-degree polynomial code (aka, the"short code" of Barak et. al. [FOCS 2012]) and the techniques proposed by Dinur and

PCPs via Low-Degree Long Code and Hardness for Constrained Hypergraph Coloring

  • Irit DinurV. Guruswami
  • Computer Science
    2013 IEEE 54th Annual Symposium on Foundations of Computer Science
  • 2013
New techniques to incorporate the recently proposed “short code” into the construction and analysis of PCPs in the classical “label-cover + Fourier Analysis” framework are developed, obtaining more size-efficient PCPs that yield improved hardness results for approximating CSPs and certain coloring-type problems.

Making the Long Code Shorter

A new code is constructed that is exponentially more efficient, but can still be used in many of these applications, and a connection between the local testability of linear codes and small set expansion in certain related Cayley graphs is shown.

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.

On the Conditional Hardness of Coloring a 4-Colorable Graph with Super-Constant Number of Colors

A variant of the Majority is Stablest Theorem, which says that among all balanced functions whose each coordinate has o(1) influence, the Majority function has the largest noise stability, is adapted for applications to get a better dependency between the parameters required for the reduction.

Reducing uniformity in Khot-Saket hypergraph coloring hardness reductions

  • G. Varma
  • Computer Science, Mathematics
    Chic. J. Theor. Comput. Sci.
  • 2015
The quasi-NP-hardness of the following problems on n-vertex hypergraphs is proved: Coloring a 2-colorable 8-uniform hypergraph with $2^{(\log n)^{\Omega(1)}}$ colors.

Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with 2log nΩ(1) Colors

It is quasi-NP-hard to color 2-colorable 12-uniform hypergraphs with 2 Ω(1) colors where n is the number of vertices and the result is obtained by composing a new Outer PCP with an Inner PCP based on the Short Code of degree two.

Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with 2(log n)Ømega(1) Colors

It is quasi-NP-hard to color 2-colorable 12-uniform hypergraphs with $2^{(\log n)^{\Omega(1) }}$ colors where $n$ is the number of vertices.

Optimal Testing of Reed-Muller Codes

This work shows that the Gowers norm test is tolerant, in that it also accepts close code words, and improves the parameters of an XOR lemma for polynomials given by Viola and Wigderson for graph properties.

Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with exp(log^{Omega(1)} n) Colors

It is quasi-NP-hard to color 2-colorable 12-uniform hypergraphs with 2(log n) O(1) colors where n is the number of vertices.