The Algorithmic Phase Transition of Random $k$ -SAT for Low Degree Polynomials

3 June 2021

Papers citing "The Algorithmic Phase Transition of Random $k$-SAT for Low Degree Polynomials"

22 / 22 papers shown

Title
Algorithmic Obstructions in the Random Number Partitioning Problem D. Gamarnik Eren C. Kizildaug 38 22 0 02 Mar 2021
Optimal Low-Degree Hardness of Maximum Independent Set Alexander S. Wein 52 45 0 13 Oct 2020
Statistical Query Algorithms and Low-Degree Tests Are Almost Equivalent Matthew Brennan Guy Bresler Samuel B. Hopkins Jingkai Li T. Schramm 34 62 0 13 Sep 2020
Computational Barriers to Estimation from Low-Degree Polynomials T. Schramm Alexander S. Wein 49 60 0 05 Aug 2020
Free Energy Wells and Overlap Gap Property in Sparse PCA Gerard Ben Arous Alexander S. Wein Ilias Zadik 27 32 0 18 Jun 2020
Tensor Clustering with Planted Structures: Statistical Optimality and Computational Limits Yuetian Luo Anru R. Zhang 77 44 0 21 May 2020
Reducibility and Statistical-Computational Gaps from Secret Leakage Matthew Brennan Guy Bresler 49 86 0 16 May 2020
Detection thresholds in very sparse matrix completion C. Bordenave Simon Coste R. Nadakuditi 32 25 0 12 May 2020
Algorithms for Heavy-Tailed Statistics: Regression, Covariance Estimation, and Beyond Yeshwanth Cherapanamjeri Samuel B. Hopkins Tarun Kathuria P. Raghavendra Nilesh Tripuraneni 111 39 0 23 Dec 2019
The Overlap Gap Property in Principal Submatrix Recovery D. Gamarnik Aukosh Jagannath S. Sen 40 28 0 26 Aug 2019
Notes on Computational Hardness of Hypothesis Testing: Predictions using the Low-Degree Likelihood Ratio Dmitriy Kunisky Alexander S. Wein Afonso S. Bandeira 57 137 0 26 Jul 2019
Subexponential-Time Algorithms for Sparse PCA Yunzi Ding Dmitriy Kunisky Alexander S. Wein Afonso S. Bandeira 64 58 0 26 Jul 2019
The Landscape of the Planted Clique Problem: Dense subgraphs and the Overlap Gap Property D. Gamarnik Ilias Zadik 16 38 0 15 Apr 2019
Fundamental Barriers to High-Dimensional Regression with Convex Penalties Michael Celentano Andrea Montanari 58 46 0 25 Mar 2019
Computational Hardness of Certifying Bounds on Constrained PCA Problems Afonso S. Bandeira Dmitriy Kunisky Alexander S. Wein 44 64 0 19 Feb 2019
Bayesian estimation from few samples: community detection and related problems Samuel B. Hopkins David Steurer 48 63 0 30 Sep 2017
Local algorithms for independent sets are half-optimal Mustazee Rahman Bálint Virág 33 90 0 03 Feb 2014
Performance of the Survey Propagation-guided decimation algorithm for the random NAE-K-SAT problem D. Gamarnik Madhu Sudan 42 17 0 01 Feb 2014
Limits of local algorithms over sparse random graphs D. Gamarnik Madhu Sudan 51 163 0 05 Apr 2013
State Evolution for General Approximate Message Passing Algorithms, with Applications to Spatial Coupling Adel Javanmard Andrea Montanari 58 261 0 21 Nov 2012
Message Passing Algorithms for Compressed Sensing D. Donoho A. Maleki Andrea Montanari 93 2,352 0 21 Jul 2009
Solving Constraint Satisfaction Problems through Belief Propagation-guided decimation Andrea Montanari F. Ricci-Tersenghi G. Semerjian 112 83 0 11 Sep 2007

The Algorithmic Phase Transition of Random kkk-SAT for Low Degree Polynomials

Papers citing "The Algorithmic Phase Transition of Random $k$-SAT for Low Degree Polynomials"

The Algorithmic Phase Transition of Random $k$ -SAT for Low Degree Polynomials