A simpler strong refutation of random $k$-XOR
Data Structures and Algorithms
2020-08-11 v1
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 algorithm and analysis.
Cite
@article{arxiv.2008.03556,
title = {A simpler strong refutation of random $k$-XOR},
author = {Kwangjun Ahn},
journal= {arXiv preprint arXiv:2008.03556},
year = {2020}
}
Comments
16 pages; presented at International Conference on Randomization and Computation (RANDOM) 2020