DROPS

Document

RANDOM

DOI: 10.4230/LIPIcs.APPROX/RANDOM.2020.2

A Simpler Strong Refutation of Random k-XOR

Authors: Kwangjun Ahn

Published in: LIPIcs, Volume 176, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)

Abstract

Strong refutation of random CSPs is a fundamental question in theoretical computer science that has received particular attention due to the long-standing gap between the information-theoretic limit and the computational limit. This gap is recently bridged by Raghavendra, Rao and Schramm where they study sub-exponential algorithms for the regime between the two limits. In this work, we take a simpler approach to their algorithms and analyses.

Cite as

Kwangjun Ahn. A Simpler Strong Refutation of Random k-XOR. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 176, pp. 2:1-2:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)

Copy BibTex To Clipboard

@InProceedings{ahn:LIPIcs.APPROX/RANDOM.2020.2,
  author =	{Ahn, Kwangjun},
  title =	{{A Simpler Strong Refutation of Random k-XOR}},
  booktitle =	{Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020)},
  pages =	{2:1--2:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-164-1},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{176},
  editor =	{Byrka, Jaros{\l}aw and Meka, Raghu},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2020.2},
  URN =		{urn:nbn:de:0030-drops-126053},
  doi =		{10.4230/LIPIcs.APPROX/RANDOM.2020.2},
  annote =	{Keywords: Strong refutation, Random k-XOR, Spectral method, Trace power method}
}

Search Results

Documents authored by Ahn, Kwangjun

A Simpler Strong Refutation of Random k-XOR

Abstract

Cite as

Thanks for your feedback!

Could not send message