随机$k$ - XOR的一个简单强反驳
A simpler strong refutation of random $k$-XOR
摘要：
随机CSP的强反驳是理论计算机科学中的一个基本问题，由于信息论极限和计算极限之间的长期差距而受到特别关注。这一差距是最近弥合Raghavendra，饶和施拉姆，他们研究次指数算法之间的制度的两个限制。在这项工作中，我们采取了一种更简单的方法，他们的算法和分析。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
