{"total":16,"rows":[{"id":"2205.09727","title":"The Franz-Parisi Criterion and Computational Trade-offs in High Dimensional Statistics","created":"2022-05-19","cited_by_count":31,"area":null},{"id":"2106.02129","title":"The Algorithmic Phase Transition of Random $k$-SAT for Low Degree Polynomials","created":"2021-06-03","cited_by_count":14,"area":null},{"id":"2109.06915","title":"Reconstruction on Trees and Low-Degree Polynomials","created":"2021-09-14","cited_by_count":10,"area":null},{"id":"2211.05274","title":"Average-Case Complexity of Tensor Decomposition for Low-Degree Polynomials","created":"2022-11-10","cited_by_count":6,"area":null},{"id":"2308.15728","title":"Computational Lower Bounds for Graphon Estimation via Low-degree Polynomials","created":"2023-08-30","cited_by_count":6,"area":null},{"id":"2409.00966","title":"A computational transition for detecting correlated stochastic block models by low-degree polynomials","created":"2024-09-02","cited_by_count":6,"area":null},{"id":"2506.19276","title":"Rare dense solutions clusters in asymmetric binary perceptrons -- local entropy via fully lifted RDT","created":"2025-06-24","cited_by_count":5,"area":null},{"id":"2301.11124","title":"SQ Lower Bounds for Random Sparse Planted Vector Problem","created":"2023-01-26","cited_by_count":3,"area":null},{"id":"2502.09832","title":"Computational Lower Bounds for Correlated Random Graphs via Algorithmic Contiguity","created":"2025-02-14","cited_by_count":3,"area":null},{"id":"2511.01037","title":"Binary perceptron computational gap -- a parametric fl RDT view","created":"2025-11-02","cited_by_count":3,"area":null},{"id":"2306.02555","title":"Barriers for the performance of graph neural networks (GNN) in discrete random structures. A comment on~\\cite{schuetz2022combinatorial},\\cite{angelini2023modern},\\cite{schuetz2023reply}","created":"2023-06-05","cited_by_count":1,"area":null},{"id":"2601.10628","title":"Parametric RDT approach to computational gap of symmetric binary perceptron","created":"2026-01-15","cited_by_count":1,"area":null},{"id":"2312.14588","title":"On a Near-Optimal \\& Efficient Algorithm for the Sparse Pooled Data Problem","created":"2023-12-22","cited_by_count":0,"area":null},{"id":"2504.03097","title":"A Computational Transition for Detecting Multivariate Shuffled Linear Regression by Low-Degree Polynomials","created":"2025-04-04","cited_by_count":0,"area":null},{"id":"2509.09904","title":"A Smooth Computational Transition in Tensor PCA","created":"2025-09-12","cited_by_count":0,"area":null},{"id":"2604.19712","title":"Ultrametric OGP - parametric RDT \\emph{symmetric} binary perceptron connection","created":"2026-04-21","cited_by_count":0,"area":null}],"next_cursor":null}